Pagini recente » Cod sursa (job #1848790) | Cod sursa (job #2685706) | Cod sursa (job #11706) | Cod sursa (job #692442) | Cod sursa (job #2401629)
#include <bits/stdc++.h>
#define Nmax 50005
using namespace std;
ifstream fin ("bellmanford.in");
ofstream fout ("bellmanford.out");
struct muchie
{
int y, c;
};
vector <muchie> v[Nmax];
queue <int> q;
bool este[Nmax];
int n, m, i, x, y, c, ap[Nmax], d[Nmax], u;
int main()
{
fin >> n >> m;
for(i=1;i<=m;i++)
{
fin >> x >> y >> c;
v[x].push_back({y, c});
}
for(i=2;i<=n;i++)
d[i]=INT_MAX;
q.push(1);
ap[1]++;
este[1]=1;
while(!q.empty())
{
u=q.front();
este[u]=0;
q.pop();
for(i=0;i<v[u].size();i++)
if(d[v[u][i].y]>d[u]+v[u][i].c)
{
d[v[u][i].y]=d[u]+v[u][i].c;
if(este[v[u][i].y]==0)
{
ap[v[u][i].y]++;
este[v[u][i].y]=0;
if(ap[v[u][i].y]==n)
{
fout << "Ciclu negativ";
return 0;
}
q.push(v[u][i].y);
}
}
}
for(i=2;i<=n;i++)
fout << d[i] << ' ';
return 0;
}