Cod sursa(job #1125161)

Utilizator FasinedJohnny Bravo Fasined Data 26 februarie 2014 16:05:27
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include<fstream>
#include<deque>
#include<vector>
#define nx 50007
using namespace std;
int dist[nx],viz[nx],n,m,i,x,y,c;
vector<pair<int,int> >v[nx];
deque<int>d;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

void bell()
{
    d.push_back(1);
    viz[1]=1;
    while(!d.empty())
    {
        x=d.front(),d.pop_front();
        for(i=0;i<v[x].size();i++)
        {
            y=v[x][i].first;
            c=v[x][i].second;
            if(dist[y]>dist[x]+c || !dist[y])
            {
                dist[y]=dist[x]+c;
                d.push_back(y);
                viz[y]++;
            }
            if(viz[y]>n){
                fout<<"Ciclu negativ!";
                return;
                }
        }
    }
    for(i=2;i<=n;i++)fout<<dist[i]<<' ';
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    bell();
    return 0;
}