Cod sursa(job #2128946)

Utilizator LauraNaduLaura Nadu LauraNadu Data 12 februarie 2018 12:20:56
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include<fstream>
#define inf 2000000000
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n, a[100][100], d[100], m;
int bellman(int nod)
{
    int ok;
    for(int i=1;i<=n;i++)
        d[i]=inf;
    d[nod]=0;
    for(int i=1;i<=n;i++)
    {
        ok=0;
        for(int j=1;j<=n;j++)
            for(int k=1;k<=n;k++)
                if(d[j]+a[j][k]<d[k])
                {
                    d[k]=d[j]+a[j][k];
                    ok=1;
                }
    }
    if(ok==1)
        g<<"Contine cicluri negative";
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x, y;
        f>>x>>y>>a[x][y];
        a[y][x]=a[x][y];
    }
    bellman(1);
    for(int i=1;i<=n;i++)
        g<<d[i]<<" ";
    return 0;
}