Cod sursa(job #1614054)

Utilizator SlevySlevoaca Stefan-Gabriel Slevy Data 25 februarie 2016 19:42:09
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>

using namespace std;

const int NMAX = 101;
int graf[NMAX][NMAX];
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;

void citire()
{
    in>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        in>>graf[i][j];
    in.close();
}

void roy()
{
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
            if(i!=k && i!=j && graf[i][k] + graf[k][j] < graf[i][j])
            graf[i][j] = graf[i][k] + graf[k][j];
}

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

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