Pagini recente » Cod sursa (job #2170924) | Cod sursa (job #1767637) | Cod sursa (job #2114203) | Cod sursa (job #165826) | Cod sursa (job #664326)
Cod sursa(job #664326)
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
FILE*f=fopen("bellmanford.in","r");
FILE*g=fopen("bellmanford.out","w");
int n,m,x,y,c,nr,d[50001],s[50001];
char viz[50001];
vector <pair<int,int> > v[50001];
queue <int> a;
int main()
{
fscanf(f,"%d%d",&n,&m);
for(int i=1;i<=m;++i){
fscanf(f,"%d%d%d",&x,&y,&c);
v[x].push_back (make_pair(y,c));
}
for(int i=2;i<=n;++i) d[i]=2000000000;
a.push (1);
viz[1]=1;
int k=1;
while( k&&a.size())
{
int nod=a.front();
for(int i=0;i<int(v[nod].size());++i)
{
if(d[v[nod][i].first]>d[nod]+v[nod][i].second)
{
if(!viz[v[nod][i].first])
{
a.push(v[nod][i].first);
viz[v[nod][i].first]=1;
}
d[v[nod][i].first]=d[nod]+v[nod][i].second;
s[v[nod][i].first]++;
if(s[v[nod][i].first]==n)
{
k=0;
break;
}
}
}
viz[nod]=0;
a.pop();
}
if(!k)
fprintf(g,"Ciclu negativ!");
else
for(int i=2;i<=n;++i) fprintf(g,"%d ",d[i]);
fclose(f);
fclose(g);
return 0;
}