Cod sursa(job #1442839)

Utilizator miahiFMI Honceriu Mihai miahi Data 26 mai 2015 13:53:04
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.24 kb
#include<iostream>
#include<fstream>

using namespace std;

int matriceaPonderilor[101][101];
/*void descompun_drum(int i,int j)
{
    int ok=0,k=1;
    while(k<=n&&!ok)
    {
        if(i!=k&&j!=k)
        if(a[i][j]==a[i][k]+a[k][j])
        {
        descompun_drum(i,k);
        descompun_drum(k,j);
        ok=1;
        }
     k++;
    }
    if(!ok)
    {
        matriceaPonderilor[i][j]=
    }

}*/
int main()
{
    ifstream in("royfloyd.in");
    ofstream out("royfloyd.out");
    int nrNoduri,i,j,l;
    in>>nrNoduri;


    for(i=1;i<=nrNoduri;i++)
        for(j=1;j<=nrNoduri;j++)
            in>>matriceaPonderilor[i][j];

    for(l=1;l<=nrNoduri;l++)
        for(i=1;i<=nrNoduri;i++)
            for(j=1;j<=nrNoduri;j++)
                if(matriceaPonderilor[i][l]!=0&&matriceaPonderilor[l][j]!=0)
                    if(matriceaPonderilor[i][j]>matriceaPonderilor[i][l]+matriceaPonderilor[l][j] || matriceaPonderilor[i][j]==0)
                        if(i!=j)
                        matriceaPonderilor[i][j]=matriceaPonderilor[i][l]+matriceaPonderilor[l][j];
    for(i=1;i<=nrNoduri;i++)
    {
        for(j=1;j<=nrNoduri;j++)
            out<<matriceaPonderilor[i][j]<<" ";
        out<<"\n";
    }
}