Pagini recente » Cod sursa (job #41814) | Cod sursa (job #1837664) | Cod sursa (job #2865728) | Cod sursa (job #1683023) | Cod sursa (job #561168)
Cod sursa(job #561168)
#include<vector>
#include<fstream>
using namespace std;
#define nn 50001
#define pb push_back
#define mp make_pair
#define infinit 1<<30
vector< pair <int,int> >g[nn];
int n,m,d[nn],v[nn],apar[nn];
void citire(){
int a,b,c;
ifstream fin("bellmanford.in");
fin>>n>>m;
for(;m;--m){
fin>>a>>b>>c;
g[a].pb(mp(b,c));
}
}
int bellmann(int sursa){
for(int i=1;i<=n;++i)
d[i]=infinit;
d[sursa]=0;
v[sursa]=1;
int coada[nn],st,dr,i;
st=dr=1;
coada[1]=sursa;
while(st<=dr){
int k=coada[st++];
v[k]=0;//esential
if(d[k]<infinit)
for(i=0;i<g[k].size();++i){
int kk=g[k][i].first;
int cost=g[k][i].second;
if(d[k]+cost<d[kk]){
d[kk]=d[k]+cost;
if(!v[kk]){
if(apar[kk]>n)
return 1;
apar[kk]++;
v[kk]=1;
coada[++dr]=kk;
}
}
/*else
if(!v[kk]){
v[kk]=1;
coada[++dr]=kk;
}*/
}
}
return 0;
}
void afisare(){
FILE *f=fopen("bellmanford.out","w");
if(bellmann(1))
fprintf(f,"Ciclu negativ!");
else
for(int i=2;i<=n;++i)
fprintf(f,"%d ",d[i]!=infinit?d[i]:0);
}
int main(){
citire();
afisare();
return 0;
}