Cod sursa(job #870983)

Utilizator DianaEllenaDiana Elena DianaEllena Data 4 februarie 2013 11:23:47
Problema Arbore partial de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.39 kb
#include <fstream>
#include <vector>
#define Infinit 100000000
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n,m,start,val,ok;
int viz[50010],cmin[50010];
int coada[500001],nrpus[50001];

vector<int>c[50001];
vector<int>a[50001];

void citire();
void init();
int bellman_ford(int vf);
void detdrum(int k);
void afisare();

int main()
{
    citire();
    init();
    bellman_ford(1);
    afisare();
    fout.close();
    return 0;
}

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

void init()
{
     int i;
     for(i=1;i<=n;i++)
        cmin[i]=Infinit;
}

int bellman_ford(int vf)
{
   int i,j,k,inc=1,sf=1,x;
   cmin[vf]=0; coada[1]=vf;
   while(inc<=sf)
   {
       x=coada[inc++];
       for(i=0;i<a[x].size();i++)
       {
            if(cmin[a[x][i]]>cmin[x]+c[x][i])
                {
                    coada[++sf]=a[x][i];
                    cmin[a[x][i]]=cmin[x]+c[x][i];
                    nrpus[a[x][i]]++;
                }
            if(nrpus[a[x][i]]>=n) {ok=1; break;}
       }
       if(ok) break;
   }
   return ok;
}

void afisare()
{
    int i;
    if(ok==1) fout<<"Ciclu negativ!";
    else
        for(i=2;i<=n;i++) fout<<cmin[i]<<' '; //detdrum(i);
}