Pagini recente » Cod sursa (job #2350444) | Cod sursa (job #1212487) | Cod sursa (job #1572928) | Ciorna | Cod sursa (job #2075877)
#include <iostream>
#include <fstream>
#define NMAX 100
#define INFINITY 100000
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void floydWarshall(int M[NMAX][NMAX], int n) {
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (i != j && M[i][k] != INFINITY && M[k][j] != INFINITY)
if (M[i][j] > M[i][k] + M[k][j] || M[i][j] == INFINITY)
M[i][j] = M[i][k] + M[k][j];
}
}
int main()
{
int n, M[NMAX][NMAX];
fin>>n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
fin>>M[i][j];
if (M[i][j] == 0)
M[i][j] = INFINITY;
}
floydWarshall(M, n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (M[i][j] == INFINITY)
fout<<"0 ";
else
fout<<M[i][j]<<' ';
}
fout<<"\n";
}
return 0;
}