Pagini recente » Cod sursa (job #2031417) | Cod sursa (job #1555113) | Monitorul de evaluare | Cod sursa (job #2342401) | Cod sursa (job #2723296)
#include <fstream>
#include <vector>
#define NMAX 50000
using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
int n,m, coada[NMAX+1];
int esteincoada[NMAX+1];
struct ura
{
int nr, d;
} viz[NMAX+1];
vector < pair <int, int>> v[NMAX+1];
const int INF = 1000000000;
bool alg()
{
for (int i=1; i<=n; i++)
viz[i].d=INF;
viz[1].d=0;
esteincoada[1]=1;
int inc=1;
int sf=1;
coada[inc]=1;
while (inc<=sf)
{
int nod = coada[inc];
viz[nod].nr ++;
if (viz[nod].nr>=n)
return false;
for (int i=0; i<v[nod].size(); i++)
{
int vecin = v[nod][i].first;
int dist = v[nod][i].second;
if (viz[nod].d + dist < viz[vecin].d)
{
viz[vecin].d = viz[nod].d + dist;
if (!esteincoada[vecin])
coada[++sf]=vecin;
}
}
inc++;
}
return true;
}
int main()
{
cin>>n>>m;
for (int i=1; i<=m; i++)
{
int n1,n2,c;
cin>>n1>>n2>>c;
v[n1].push_back(make_pair(n2,c));
}
if (alg())
for (int i=2; i<=n; i++)
cout<<viz[i].d<<" ";
else
cout<<"Ciclu negativ!";
return 0;
}