Cod sursa(job #2214852)

Utilizator RoxietteTudor Roxana Roxiette Data 20 iunie 2018 11:59:22
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <iostream>
#include <fstream>
using namespace std;
int a[101][101];
int n, i , j, INF;

void floydwarsh()
{ int k;
    for (k=1;k<=n;k++)
        for(i=1;i<=n;i++)
          for(j=1;j<=n;j++)
            {if(a[i][j] > a[i][k] + a[k][j])
              a[i][j]= a[i][k]+ a[k][j];}
}

int main()
{
    ifstream f("royfloyd.in");
    f>>n;
   for (i=1;i<=n;i++)
    {for(j=1;j<=n;j++)
       f>>a[i][j];}
  for (i=1;i<=n;i++)
   {for(j=1;j<=n;j++)
         if(a[i][j]==0 && i!=j)
             a[i][j]=INF;}

    for (i=1;i<=n;i++)
    {for(j=1;j<=n;j++)
      cout<<a[i][j]<<" ";
     cout<<endl;}

   cout<<endl;

  ofstream g("royfloyd.out");

    floydwarsh();

      for (i=1;i<=n;i++)
        {for(j=1;j<=n;j++)
         if ( a[i][j]==INF)
          g<<"0";
          else
            g<<a[i][j]<<" ";
           g<<endl;
                   }


}