Pagini recente » Cod sursa (job #1419403) | Cod sursa (job #827405) | Cod sursa (job #827427) | Cod sursa (job #827425) | Cod sursa (job #2535952)
#include <iostream>
//#include <fstream>
#define INFINIT 1000000000
using namespace std;
int n , a[105][105], v[105], d[105], t[105];
int main()
{
freopen("dijkstra.in","r",stdin);
freopen("dijkstra.out","w",stdout);
int i , j , c , p,O;
p=1;
cin >> n >> O;
for(i =1 ; i <= n ; ++i)
for(j = 1 ; j <= n ; ++j)
a[i][j] = INFINIT;
for(int pl=1;pl<=O;pl++){
cin >> i >> j >> c;
a[i][j] = c;
}
for(i =1 ; i <= n ; i ++ )
{
v[i] = 0;
d[i] = a[p][i];
t[i] = p;
}
v[p] = 1, t[p] = 0, d[p] = 0;
d[0] = INFINIT;
for(int k = 1 ; k < n ; ++k)
{
int pmax = 0;
for(i = 1 ; i <= n ; ++i)
if(v[i] == 0 && d[i] < d[pmax])
pmax = i;
if(pmax > -1)
{
v[pmax] = 1;
for(i = 1; i <= n ; ++i)
if(v[i] == 0 && d[i] > d[pmax] + a[pmax][i])
d[i] = d[pmax] + a[pmax][i], t[i] = pmax;
} }
for(i = 2 ;i <= n ; ++i)
cout << (d[i] != INFINIT ? d[i] : -1) << " ";
return 0;
}