Pagini recente » Cod sursa (job #2963540) | Cod sursa (job #460548) | Cod sursa (job #2847968) | Cod sursa (job #1758958) | Cod sursa (job #3250944)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
const int NMAX = 1000,
INF = 1e9;
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<=i; j++)
C[i][j] = C[j][i] = 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++)
if (C[i][j] > C[i][k] + C[k][j] && i != j)
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()
{
init();
citire();
Roy_Floyd();
afisare();
f.close();
g.close();
return 0;
}