Cod sursa(job #1124914)

Utilizator IliescuDanAndreiIliescu Dan Andrei IliescuDanAndrei Data 26 februarie 2014 14:23:36
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

int graf[1000][1000];
int n;

int main()
{
    int i, j, k;
    in>>n;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            in>>graf[i][j][0];
        }
    }
    for(k=1;k<=n;k++)
    {
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                graf[i][j]=graf[i][j];
                if(graf[i][k]+graf[k][j]<graf[i][j] || !graf[i][j] && i!=j && graf[i][k] && graf[k][j]) graf[i][j]=graf[i][k]+graf[k][j];
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            out<<graf[i][j]<<" ";
        }
        out<<"\n";
    }
    return 0;
}