Pagini recente » Cod sursa (job #2755196) | Statistici Fur Fur (furfur233) | Cod sursa (job #1268422) | Cod sursa (job #1376973) | Cod sursa (job #1915878)
#include <bits/stdc++.h>
using namespace std;
int n, m, d[50050];
struct my{int x, y, l;}V[250100];
bool u = 1;
int main()
{
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
cin >> n >> m;
for(int i=1;i<=m;i++)
cin>>V[i].x>>V[i].y>>V[i].l;
for(int i=2;i<=n;i++)d[i]=1e9;
while(u){
u=0;
for(int i=1;i<=m;i++)
if(d[V[i].y]> d[V[i].x] + V[i].l)
d[V[i].y] = d[V[i].x] + V[i].l, u = 1;
}
for (int i = 2; i <= n; i++)
cout << (d[i] == 1e9 ? 0 : d[i]) << " ";
return 0;
}