Cod sursa(job #1917047)

Utilizator ALEx6430Alecs Andru ALEx6430 Data 9 martie 2017 11:00:57
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;

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

int n,g[101][101],a[101][101];

void citire_graf()
{
    int c;
    in>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            in>>a[i][j];
    }
}

void RoyFloyd()
{
    int i,j;
    for(int k = 1; k <= n; k++)
        for(i = 1; i <= n; i++)
            for(j = 1; j <= n; j++) //daca putem actualiza
                if(a[i][k] && a[k][j] && i != j && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
                    a[i][j] = a[i][k] + a[k][j];
}

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

int main()
{
    citire_graf();
    RoyFloyd();
    afisare_graf();
	in.close();
	out.close();
	return 0;
}