Pagini recente » Cod sursa (job #2442151) | Cod sursa (job #1565195) | Cod sursa (job #2863860) | Cod sursa (job #1188978) | Cod sursa (job #3141653)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105];
void roy_floyd()
{
for (int k = 1; k <= n; k++)//cautam un drum mai scurt avand k intermediar: i->k->j
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][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
fin >> a[i][j];
roy_floyd();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
fout << a[i][j] << " ";
fout << endl;
}
return 0;
}