Cod sursa(job #2124959)

Utilizator CodrinsahCotarlan Codrin Codrinsah Data 7 februarie 2018 19:16:30
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.24 kb
#include <fstream>
#include <vector>
#include <queue>
#define inf 50000001
using namespace std;
ifstream fi ("bellmanford.in");
ofstream fo ("bellmanford.out");
struct legatura{int nod,dist;};
vector<legatura> v[50006];
queue<int> q;
int dmin[50006],nrnod,nrmuchii,i,viz[50006];
int main()
{
    fi>>nrnod>>nrmuchii;
    for (i=1;i<=nrmuchii;i++)
    {
        int nod1,nod2,l;
        fi>>nod1>>nod2>>l;
        legatura drum;
        drum.nod=nod2;
        drum.dist=l;
        v[nod1].push_back(drum);
    }
    for (i=2;i<=nrnod;i++) dmin[i]=inf;
    q.push(1);
    viz[1]++;
    bool ciclu=false;
    while (!q.empty())
    {
        int poz=q.front();
        q.pop();
        for (i=0;i<v[poz].size();i++)
        {
            int nodurm=v[poz][i].nod;
            if (dmin[poz]+v[poz][i].dist<dmin[nodurm])
            {
                dmin[nodurm]=dmin[poz]+v[poz][i].dist;
                q.push(nodurm);
                viz[nodurm]++;
            }
        }
        if (viz[poz]==nrnod)
        {
            while (!q.empty()) q.pop();
            ciclu=true;
        }
    }
    if (ciclu) fo<<"Ciclu negativ!";
    else
    {
        for (i=2;i<=nrnod;i++) fo<<dmin[i]<<' ';
    }
    return 0;
}