Pagini recente » Cod sursa (job #283238) | Cod sursa (job #2697617) | Cod sursa (job #1862585) | Cod sursa (job #1917665) | Cod sursa (job #1207330)
#include <cstdio>
#include <vector>
#include <utility>
using namespace std;
#define MAX 50005
#define INF 50000001
vector<int> v[MAX];
vector<int> w[MAX];
int d[MAX];
int main()
{
freopen("bellmanford.in","r",stdin);
freopen("bellmanford.out","w",stdout);
int n, m, i, j, x, y, ww;
scanf("%d%d",&n,&m);
for(i=2; i<=n; i++)
d[i] = INF;
d[1]=0;
for(i=1; i<=m; i++)
{
scanf("%d%d%d",&x,&y,&ww);
v[x].push_back(y);
w[x].push_back(ww);
}
int ok=1, nr=0;
while(ok){
ok=0;
for(i=1; i<=n; i++)
for(j=0; j<v[i].size(); j++)
if(d[i]+w[i][j] < d[v[i][j]]){
d[v[i][j]]=d[i]+w[i][j];
ok=1;
}
nr++;
if(nr == n+2)
{
printf("Ciclu negativ!\n");
return 0;
}
}
for(i=1; i<=n; i++)
for(j=0; j<v[i].size(); j++)
if(d[i]+w[i][j] < d[v[i][j]])
{
printf("-1\n");
return 0;
}
for(i=2; i<=n; i++)
printf("%d ",d[i]);
return 0;
}