Pagini recente » Cod sursa (job #2144921) | Cod sursa (job #2271068) | Cod sursa (job #2753266) | Cod sursa (job #1312805) | Cod sursa (job #1223210)
#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#define DIM 50011
#define INF 1008099002
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n,m,ng;
int D[DIM],U[DIM];
queue<int> Q;
vector<pair<int,int> > L[DIM];
vector<pair<int,int> >::iterator it;
bitset<DIM> viz;
int main(void){
register int x,c,y,i,j;
f>>n>>m;
for(i=1;i<=m;i++)
f>>x>>y>>c,L[x].push_back(make_pair(c,y));
for(i=2;i<=n;i++) D[i]=INF;
Q.push(1),viz[1]=1;
while(!Q.empty() && !ng){
x=Q.front(),Q.pop(),viz[x]=1;
for(it=L[x].begin();it!=L[x].end();it++){
if(it->first+D[x]<D[it->second]){
D[it->second]=D[x]+it->first;
U[it->second]++;
if(U[it->second]==n){
ng=1;
break;
}
if(!viz[it->second])
Q.push(it->second),viz[it->second]=1;
}
}
}
if(ng)
g<<"Ciclu negativ";
else
for(i=2;i<=n;i++) g<<D[i]<<" ";
f.close();
g.close();
return 0;
}