Pagini recente » Cod sursa (job #2973851) | Cod sursa (job #1931055) | Cod sursa (job #2612463) | Cod sursa (job #1671689) | Cod sursa (job #1223231)
#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;
pair<int,int> p;
f>>n>>m;
for(i=1;i<=m;i++)
f>>x>>y>>c,L[x].push_back(make_pair(y,c));
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]=0;
for(it=L[x].begin();it!=L[x].end();it++){
p=*it;
if(D[p.first]>D[x]+p.second){
U[p.first]++;
if(U[p.first]==n){
ng=1; break;
}
D[p.first]=D[x]+p.second;
if(!viz[p.first])
Q.push(p.first),viz[p.first]=true;
}
}
}
if(ng)
g<<"Ciclu negativ\n";
else
for(i=2;i<=n;i++) g<<D[i]<<" ";
f.close();
g.close();
return 0;
}