Pagini recente » Cod sursa (job #1220682) | Cod sursa (job #398256) | Cod sursa (job #1766782) | Cod sursa (job #527333) | Cod sursa (job #2397134)
#include <fstream>
//#include <iostream>
#include <vector>
#include <limits.h>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int viz[50005],dist[50005];
int main()
{
int i,nod,arc,x,y,cost;
vector < int> vect[50005];
vector < int> vectc[50005];
cin>>nod>>arc;
for(i=1;i<=arc;i++){
cin>>x>>y>>cost;
vect[x].push_back(y);
vectc[x].push_back(cost);
}
dist[1]=0;
for(i=2;i<=nod;i++)
dist[i]=INT_MAX;
for(int t=1;t<=nod;t++){
int vmin=INT_MAX;
int index=-1;
for(int j=1;j<=nod;j++){
if(!viz[j] && dist[j]<vmin){
vmin=dist[j];
index=j;
}
}
viz[index]=1;
int lim=vect[index].size();
for(int i=0;i<lim;i++){
int vecin=vect[index][i];
if(dist[vecin]>dist[index]+vectc[index][i])
dist[vecin]=dist[index]+vectc[index][i];
}
}
for(i=2;i<=nod;i++)
if(dist[i]==INT_MAX)
cout<<0<<" ";
else
cout<<dist[i]<<" ";
return 0;
}