Pagini recente » Rating Cozman Denis (Cozman_Denis) | Cod sursa (job #1511151) | Monitorul de evaluare | Cod sursa (job #1576818) | Cod sursa (job #2214856)
#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] && i!=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];
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)
a[i][j]=0;
}
g<<a[i][j]<<" ";
g<<endl;
}
}