Pagini recente » Cod sursa (job #2927229) | Cod sursa (job #327831) | Cod sursa (job #2436562) | Cod sursa (job #155954) | Cod sursa (job #862032)
Cod sursa(job #862032)
#include <fstream>
#define INF 1000000000
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n, start;
int cmin[5010], c[5010][5010];
int tata[5010];
void citire();
void bellman_ford();
int main()
{
citire();
bellman_ford();
return 0;
}
void citire()
{
int i, m, x, y, cost, j;
fin>>n>>m; start=1;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
c[i][j]=INF;
for(i=1;i<=m;i++)
{
fin>>x>>y>>cost;
c[x][y]=cost;
}
}
void bellman_ford()
{
int i, j, x, op;
for(i=1;i<=n;i++)
cmin[i]=INF;
cmin[start]=0;
for(i=1;i<=n;i++)
{
op=0;
for(j=1;j<=n;j++)
for(x=1;x<=n;x++)
if (cmin[j]!=INF&&c[j][x]!=INF)
if(cmin[x]>cmin[j]+c[j][x])
{
cmin[x]=cmin[j]+c[j][x];
tata[x]=j; op=1;
}
}
if(op==1)
fout<<"Ciclu negativ!"<<'\n';
else
{
for(i=2;i<=n;i++)
fout<<cmin[i]<<' ';
fout<<'\n';
}
}