Cod sursa(job #2194734)
Utilizator | Radu Minea raduq | Data | 14 aprilie 2018 11:47:34 |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
#include<cstdio>
#include<set>
#include<vector>
using namespace std;
set<pair<int,int> > s;
vector<pair<int,int> >v[50001];
int n,m,dist[50001];
void citire()
{
int x,y,z;
cin>>x>>y>>z;
v[x].push_back(make_pair(y,z));
}
void dijkstra()
{
}
int main()
{
freopen("dijkstra.in","r",stdin);
freopen("dijkstra.out","w",stdout);
int i;
cin>>n>>m;
for(i=1; i<=m; i++) citire();
return 0;
}