Pagini recente » Cod sursa (job #179955) | Cod sursa (job #1778439) | Cod sursa (job #1909487) | Cod sursa (job #2254930) | Cod sursa (job #2086288)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
const int nm=50000;
const int inf=1e9;
vector<int>v[nm+5],d[nm+5];
int l[nm+5];
int dmin[nm+5];
bool viz[nm+5];
int n,m;
int a,b,c;
static inline void slove(int nod)
{
for(int i=0;i<l[nod];i++)
dmin[v[nod][i]]=min(dmin[nod]+d[nod][i],dmin[v[nod][i]]);
viz[nod]=1;
bool gasit=0;
int distmin=inf,poz;
for(int i=1;i<=n;i++)
if(viz[i]==0)
{
if(dmin[i]<distmin)
{
distmin=dmin[i];
poz=i;
gasit=1;
}
}
if(gasit==0)
return;
slove(poz);
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>a>>b>>c;
v[a].push_back(b);
d[a].push_back(c);
v[b].push_back(a);
d[b].push_back(c);
}
for(int i=1;i<=n;i++)
l[i]=v[i].size();
for(int i=1;i<=n;i++)
dmin[i]=inf;
dmin[1]=0;
slove(1);
for(int i=2;i<=n;i++)
{
if(dmin[i]==inf)
cout<<0<<" ";
else
cout<<dmin[i]<<" ";
}
return 0;
}
/**
**/