Cod sursa(job #2365185)

Utilizator serbandonceanSerban Doncean serbandoncean Data 4 martie 2019 12:23:44
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.06 kb
#include <bits/stdc++.h>
#define DMAX 50003
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
struct varf{int y1,cost;};
vector<varf>a[DMAX];
queue<int>coada;
int dist[DMAX],viz[DMAX];
void citire();
int n,m;
void bellman();
int main()
{
    citire();

    bellman();
    return 0;
}
void citire()
{int i,c,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        a[x].push_back({y,c});


    }
    for(i=2;i<=n;i++)
        dist[i]=INT_MAX-3;

}
void bellman()
{int poz,y,c,i;
    coada.push(1);
    while(!coada.empty())
    {
        poz=coada.front();
        coada.pop();
        viz[poz]++;
        if(viz[poz]>n)
        {
            fout<<"Ciclu negativ!";
            return ;
        }
        for(i=0;i<a[poz].size();i++)
        {   cout<<i;
            y=a[poz][i].y1;
            c=a[poz][i].cost;
            if(dist[y]>dist[poz]+c)
                {dist[y]=dist[poz]+c;coada.push(y);}
        }

    }
    for(i=2;i<=n;i++)
        fout<<dist[i]<<' ';

}