Pagini recente » Cod sursa (job #1335054) | Cod sursa (job #2809865) | Cod sursa (job #2654803) | Cod sursa (job #2665276) | Cod sursa (job #3238536)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n, m, d[50002], viz[50002], x, y, c;
vector<pair<int,int>> v[50002];
void dijsktra(int s)
{
for(auto i:v[1])
d[i.first]=i.second;
viz[1]=1;
for(int i=1; i<n; i++)
{
int mn=1e9,y;
for(int i=1; i<=n; i++)
if(mn>d[i] && viz[i]==0)
{
mn=d[i];
y=i;
}
for(auto i: v[y])
if(d[i.first]>d[y]+i.second)
d[i.first]=d[y]+i.second;
viz[y]=1;
}
}
int main()
{
cin>>n>>m;
for(int i=1; i<=m; i++)
{
cin>>x>>y>>c;
v[x].push_back(make_pair(y,c));
}
for(int i=1; i<=n; i++)
d[i]=1e9;
dijsktra(1);
for(int i=2; i<=n; i++)
if(d[i]==1e9)
cout<<0<<" ";
else
cout<<d[i]<<" ";
}