Pagini recente » Cod sursa (job #2660361) | Cod sursa (job #810473) | Cod sursa (job #2660312) | Cod sursa (job #2660269) | Cod sursa (job #1813600)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int a[110][110];
int n;
void citire()
{
fin >> n;
for(int i=1; i<=n;i++)
for(int j=1;j<=n;j++)
fin >> a[i][j];
}
void roy_floyd ()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=k and j!=k and i!=j and a[i][j]!=0 and a[k][j]!=0)
{
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
if(a[i][j]==0)
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++)
fout << a[i][j]<<" ";
fout<<endl;
}
}
int main()
{
citire();
roy_floyd();
afisare();
return 0;
}