Pagini recente » Cod sursa (job #710819) | Cod sursa (job #709792) | Cod sursa (job #12732) | Cod sursa (job #515033) | Cod sursa (job #1631756)
#include <fstream>
#include <iostream>
#define inf 99999999
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n, m, x, y, dist, d[32000], t[32000];
short int a[32000][32000];
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
a[i][j]=inf;
}
t[i]=inf;
d[i]=inf;
}
for(int i=1; i<=m; i++)
{
fin>>x>>y>>dist;
a[x][y]=dist;
if(x==1)
{
d[y]=dist;
t[y]=1;
}
}
int ok=1, k=1;
while(ok&&k<=n+1)
{
ok=0;
for(int i=2; i<=n; i++)
{
if(d[i]!=inf)
{
for(int j=2; j<=n; j++)
{
if(a[i][j]!=inf&&i!=j&&d[j]>d[i]+a[i][j])
{
t[j]=i;
d[j]=d[i]+a[i][j];
ok=1;
}
}
}
}
k++;
}
if(k>n)
{
fout<<"Ciclu negativ!";
}
else
{
for(int i=2; i<=n; i++)
{
fout<<d[i]<<' ';
}
}
fin.close();
fout.close();
return 0;
}
/*
6 8
1 6 8
6 5 1
5 4 -1
4 3 -2
3 2 1
2 4 2
5 2 -4
1 2 10
*/