Pagini recente » Cod sursa (job #2219563) | Cod sursa (job #99675) | Cod sursa (job #786424) | Cod sursa (job #1380082) | Cod sursa (job #3250954)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
const int NMAX = 100,
INF = 9999;
int n, C[NMAX+1][NMAX+1];
void citire() {
f >> n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
f >> C[i][j];
}
void init() {
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (C[i][j] == 0 && i != j)
C[i][j] = INF;
}
void Roy_Floyd() {
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
C[i][j] = min(C[i][j], C[i][k] + C[k][j]);
}
void afisare() {
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++)
if (C[i][j] == INF)
g << "0 ";
else
g << C[i][j] << ' ';
g << '\n';
}
}
int main()
{
citire();
init();
Roy_Floyd();
afisare();
f.close();
g.close();
return 0;
}