Cod sursa(job #2316915)

Utilizator aturcsaTurcsa Alexandru aturcsa Data 12 ianuarie 2019 16:07:52
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int A[101][101];
int n;
int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            {
                fin>>A[i][j];
                if(A[i][j]==0)
                    A[i][j]=1000000000;
            }
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                if(A[i][k]!=0 && A[k][j]!=0)
                    if(i!=j)
                        A[i][j]=min(A[i][j],A[i][k]+A[k][j]);
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            fout<<A[i][j]<<" ";
        fout<<"\n";
    }
    return 0;
}