Cod sursa(job #2332791)

Utilizator gazdac_alex@yahoo.comGazdac Alexandru Eugen [email protected] Data 31 ianuarie 2019 11:27:56
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.77 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int const maxim=1000;
int matrice[maxim][maxim];
int matrice1[maxim][maxim];
int n;
int oo=(1<<31);

void citire(){
in >> n;
for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++){
        in >> matrice[i][j];
        matrice1[i][j]=oo;
    }
}
}

void roy(){
for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++){
        for(int k=1;k<=n;k++){
            if(matrice1[i][j]>matrice[i][k]+matrice[k][j])matrice1[i][j]=matrice[i][k]+matrice[k][j];
        }
    }
}

}

void afisare(){
for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++)out << matrice1[i][j] << " ";
    out << endl;
}

}

int main(){
citire();
roy();
afisare();
return 0;}