Cod sursa(job #2876846)

Utilizator Humaru_AndreiHumaru Andrei Humaru_Andrei Data 23 martie 2022 18:27:07
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.26 kb
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50004
#define INF 1000000000

using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
void citire();
bool Bellman_Ford();
void afisare();
struct bellman_ford
{
    /* data */
    int x,c;
};
vector <bellman_ford> A[NMAX];
queue <int> C;
bool ok;
int n,m;
int cmin[NMAX];
int nr[NMAX];
int main()
{
    citire();
    ok = Bellman_Ford();
    afisare();
    return 0;
}
void citire()
{int i; int x;
    bellman_ford poz;
    fin >> n >> m;
    for (i = 1; i <=m; i++)
    {
        fin >> x >> poz.x >> poz.c;
        A[x].push_back(poz);
    }
    for (i = 1; i <=n; i++)
    cmin[i] = INF;
    cmin[1] = 0;
    nr[1] = 1;
}
bool Bellman_Ford()
{int x,j,vf,cost;
    C.push(1);
    while(!C.empty())
    {
       x = C.front(); C.pop();
       for (j = 0; j < A[x].size(); j++)
       {
           vf = A[x][j].x; cost = A[x][j].c;
           if (cmin[vf] > cost + cmin[x])
           {
               cmin[vf] = cost + cmin[x];
               nr[vf]++;
               C.push(vf);
               if (nr[vf] == n) return 0;
           }
       }
    }
   return 1;
}
void afisare()
{int i;
    if (!ok) fout << "Ciclu negativ!";
    else
    for (i = 2; i <=n; i++)
    fout << cmin[i] << " ";
}