Cod sursa(job #1382530)

Utilizator diana201297Diana Elena diana201297 Data 9 martie 2015 10:45:32
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>
using namespace std;
ifstream f("graf.in");
ofstream g("graf.out");
int a[50][50],n,x;
void xd()
{
    f >> n;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
        {
         f>>x;
         if ((i!=j)&&(x==0))
                a[i][j]=10000000;
         else a[i][j]=x;
        }
}
 void drumuri_R_F()
 {
   for(int k=1; k<=n; ++k)
    for(int i=1; i<=n; ++i)
       for(int j=1; j<=n; ++j)
        if(a[i][k]+a[k][j]<a[i][j])
            a[i][j]=a[i][k]+a[k][j];
 }
 void afisare ()
 {
     for(int i=1; i<=n; ++i)
     { for (int j=1; j<=n; ++j)
         g<<a[i][j]<<" ";
         g<<"\n";
     }
}
int main()
{   xd();
    drumuri_R_F();
    afisare();
    g.close();
    return 0;
}