Cod sursa(job #2229960)

Utilizator Anastasia11Susciuc Anastasia Anastasia11 Data 8 august 2018 16:24:06
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <fstream>
#define Nmax 105
using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int n, a[Nmax][Nmax], m, x, y, val;

void read()
{
    f >> n;
    for ( int i = 1; i <= n; i ++ )
     for ( int j = 1; j <= n; j ++ )
      f >> a[i][j];
}

void RoyFloyd()
{
    for ( int k = 1; k <= n; k ++ )
     for ( int i = 1; i <= n; i ++ )
      for ( int j = 1; j <= n; j ++ )
       if( (a[i][j] > a[i][k]+a[k][j] or a[i][j] != 0)&& a[i][k] != 0 && a[k][j]!=0 && i!=j )
        a[i][j]=a[i][k]+a[k][j];

}

void print()
{
    for ( int i = 1 ; i <= n ; i ++ )
    {
         for ( int j = 1 ; j <= n ; j ++ )
            g << a[i][j] << " ";
         g <<'\n';
    }
}
int main()
{
    read();
    RoyFloyd();
    print();
    return 0;
}