Pagini recente » Cod sursa (job #2873778) | Cod sursa (job #3237558) | Cod sursa (job #2300473) | Cod sursa (job #3237912) | Cod sursa (job #2083972)
#include <cstdio>
using namespace std;
#define NMAX 50010
#define MMAX 250010
#define inf 1000000000
struct muchie
{
int a, b, c;
} e[MMAX];
int n, m, i, j, k, cost[NMAX];
void init()
{
int i;
cost[1]=0;
for(i=2; i<=n; i++)
cost[i]=inf;
}
int check_negativ()
{
int i;
for(i=1; i<=m; i++)
if(cost[e[i].a]+e[i].c<cost[e[i].b])
return 1;
return 0;
}
int main()
{
freopen("bellmanford.in", "r", stdin);
freopen("bellmanford.out", "w", stdout);
scanf("%d%d", &n, &m);
for(i=1; i<=m; i++)
scanf("%d%d%d", &e[i].a, &e[i].b, &e[i].c);
init();
int i, j;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
if(cost[e[j].a]+e[j].c<cost[e[j].b])
cost[e[j].b]=cost[e[j].a]+e[j].c;
/*if(check_negativ())
{
printf("Ciclu negativ!\n");
return 0;
}*/
for(i=2; i<=n; i++)
if (cost[i] != inf) printf("%d ", cost[i]);
else printf("0 ");
return 0;
}