Pagini recente » Cod sursa (job #2487038) | Cod sursa (job #270334) | Cod sursa (job #1447327) | Cod sursa (job #1362630) | Cod sursa (job #3039154)
#include <fstream>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n,m,x[250003],y[250003],cost[250003],t[50003],dist[50003],c[500003],viz[50003];
const int inf=2e9;
int main()
{
int i,j,inc,sf,nc;
f >> n >> m;
for (i=1;i<=m;i++)
f >> x[i] >> y[i] >> cost[i];
for (i=1;i<=n;i++)
dist[i]=inf;
dist[1]=0;
viz[1]=c[1]=inc=sf=1;
while (inc<=sf)
{
nc=c[inc];
for (i=1;i<=m;i++)
if (dist[x[i]]+cost[i]<dist[y[i]])
{
dist[y[i]]=dist[x[i]]+cost[i];
if (!viz[y[i]])
{
viz[y[i]]=1;
c[++sf]=y[i];
}
}
viz[nc]=0;
inc++;
}
for (i=1;i<=m;i++)
if (dist[y[i]]>dist[x[i]]+cost[i])
{
g << "Ciclu negativ!";
return 0;
}
for (i=2;i<=n;i++)
g << dist[i] << ' ';
return 0;
}