Cod sursa(job #2267436)
Utilizator | Data | 23 octombrie 2018 17:36:34 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <vector>
#define MAX 250010
#define x first
#define y second
using namespace std;
int n,m,c,a,b;
vector<pair<int,int>> nd[MAX];
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
cin>>a>>b>>c,
nd[a].push_back(make_pair(b,c)),
nd[b].push_back(make_pair(a,c));
return 0;
}