Pagini recente » Cod sursa (job #1973197) | Cod sursa (job #349689) | Cod sursa (job #2293911) | Cod sursa (job #872573) | Cod sursa (job #2299362)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 101;
int n;
int a[NMAX][NMAX];
int roy[NMAX][NMAX];
int infinit = 1001;
void citeste()
{
fin >> n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
fin >> a[i][j];
}
void floyd()
{
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
if (i==j) roy[i][j] = 0;
else if (a[i][j] != 0) roy[i][j] = a[i][j];
else roy[i][j] = infinit;
}
}
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n;j++)
{
if (roy[i][j] > roy[i][k] + roy[k][j])
roy[i][j] = roy[i][k] + roy[k][j];
}
}
}
}
int main()
{
citeste();
floyd();
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
fout << roy[i][j] << " ";
fout << "\n";
}
return 0;
}