Pagini recente » Cod sursa (job #1740848) | Cod sursa (job #993419) | Cod sursa (job #778250) | Cod sursa (job #397040) | Cod sursa (job #2565447)
#include <bits/stdc++.h>
#define inf 2000000000
#define DIM 50010
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n,m,i,x,y,c,nod,vecin,cost,d[DIM],v[DIM];
bitset<DIM> f;
vector< pair<int,int> > L[DIM];
deque<int> q;
int main() {
fin>>n>>m;
for (i=1;i<=m;i++) {
fin>>x>>y>>c;
L[x].push_back({y,c});
}
for (i=2;i<=n;i++)
d[i]=inf;
q.push_back(1);
f[1]=1;
while (!q.empty()) {
nod=q.front();
q.pop_front();
f[nod]=0;
for (auto it:L[nod]) {
vecin=it.first;
cost=it.second;
if (d[vecin]>d[nod]+cost) {
if (f[vecin]==0) {
v[vecin]++;
q.push_back(vecin);
f[vecin]=1;
}
if (v[vecin]==n) {
fout<<"Ciclu negativ!";
return 0;
}
d[vecin]=d[nod]+cost;
}
}
}
for (i=2;i<=n;i++)
fout<<d[i]<<" ";
return 0;
}