Pagini recente » Cod sursa (job #2595276) | Cod sursa (job #1061310) | Cod sursa (job #2124501) | Cod sursa (job #747722) | Cod sursa (job #2658268)
#include <fstream>
#include <vector>
#define dim 50001
#define inf 10000000000
using namespace std;
ifstream fin ("date.in");
ofstream fout ("date.out");
int n, m, i, p, u, c[dim], d[dim], f[dim], viz[dim];
int x, y, z;
vector <pair <int, int > > L[dim];
int main()
{
fin>>n>>m;
for (i=1; i<=m; i++)
{
fin>>x>>y>>z;
L[x].push_back({y,z});
}
for (i=2; i<=n; i++)
d[i]=inf;
p=u=1; c[1]=1;
while (p<=u)
{
int nod=c[p];
viz[nod]=0;
for (i=0; i<L[nod].size(); i++)
{
int vecin=L[nod][i].first;
int cost=L[nod][i].second;
if (d[vecin]>d[nod]+cost)
{
d[vecin]=d[nod]+cost;
f[vecin]++;
if (f[vecin]==n)
{
fout<<"Ciclu negativ!";
return 0;
}
if (!viz[vecin])
{
viz[vecin]=1;
c[++u]=vecin;
}
}
}
p++;
}
for (i=2; i<=n; i++)
fout<<d[i]<<" ";
}