Mai intai trebuie sa te autentifici.
Cod sursa(job #1921687)
Utilizator | Data | 10 martie 2017 13:51:55 | |
---|---|---|---|
Problema | Algoritmul Bellman-Ford | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.95 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
int mat[20000][20000],inf=2000000000;
void citire (int&n)
{
int m,x,y;
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>x>>y;
in>>mat[x][y];
}
}
void construire(int n,int c[])
{
for(int i=2;i<=n;i++)
c[i]=inf;
}
void afisare(int n,int c[])
{
for(int i=2;i<=n;i++)
out<<c[i]<<' ';
}
void BF(int n,int c[])
{
int ok=1;
while(ok==1)
{
ok=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(mat[i][j]!=0&&c[j]>c[i]+mat[i][j])
{
ok=1;
c[j]=c[i]+mat[i][j];
}
}
}
}
}
int main()
{
int n,c[50001];
citire(n);
construire(n,c);
BF(n,c);
afisare(n,c);
}