Pagini recente » Cod sursa (job #2916944) | Cod sursa (job #2110334) | Cod sursa (job #276680) | Cod sursa (job #1723653) | Cod sursa (job #2562091)
#include <bits/stdc++.h>
using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
struct edgeweight
{
int x,y,weight;
} edge[250001];
int n,m,a,b,c,wnode[50001],steps,tempweight;
queue <int> q;
short seen[50001];
int main()
{
ios_base::sync_with_stdio(0);
in.tie(0);
in >> n >> m;
for(int i = 1; i <= m ; ++i)
in >> edge[i].x >> edge[i].y >> edge[i].weight;
memset(wnode, '1001', sizeof(wnode));
wnode[1] = 0;
q.push(1);
steps = m;
while(!q.empty() && steps != 1)
{
tempweight = wnode[q.front()];
for(int i = 1 ; i <= m; ++i)
if(wnode[edge[i].y] > wnode[edge[i].x] + edge[i].weight)
{
wnode[edge[i].y] = wnode[edge[i].x] + edge[i].weight;
if(seen[edge[i].y] == 0)
q.push(edge[i].y);
}
if(wnode[q.front()] == tempweight) q.pop();
steps--;
}
for(int i = 1; i <= m; ++i)
if(wnode[edge[i].y] > wnode[edge[i].x] + edge[i].weight)
{
out << "Ciclu negativ!";
return 0;
}
for(int i = 2; i <= n; ++i)
out << wnode[i] << " ";
return 0;
}