Cod sursa(job #2432123)

Utilizator AlexBolfaAlex Bolfa AlexBolfa Data 22 iunie 2019 12:28:18
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>
#define MAX 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int n,Dist[MAX][MAX];

void read();
void floydWarshall();
void print();

int main(){
    read();
    floydWarshall();
    print();
    return 0;
}
void floydWarshall(){
    int i,j,k;
    for(k=1;k<=n;++k)
        for(i=1;i<=n;++i)
            for(j=1;j<=n;++j)
                if(Dist[i][k]&&Dist[k][j]&&i!=j)
                    if(Dist[i][j])
                        Dist[i][j]=min(Dist[i][j],Dist[i][k]+Dist[k][j]);
                    else
                        Dist[i][j]=Dist[i][k]+Dist[k][j];
}
void print(){
    int i,j;
    for(i=1;i<=n;++i){
        for(j=1;j<=n;++j)
            fout<<Dist[i][j]<<' ';
        fout<<'\n';
    }
}
void read(){
    int i,j;
    fin>>n;
    for(i=1;i<=n;++i){
        for(j=1;j<=n;++j)
            fin>>Dist[i][j];
    }
}