Pagini recente » Cod sursa (job #32484) | Cod sursa (job #1326159) | Cod sursa (job #1366310) | Cod sursa (job #988976) | Cod sursa (job #2201996)
#include <iostream>
#include <fstream>
#define dMAX 100
using namespace std;
int n;
int graf[dMAX + 2][dMAX + 2];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void Roy_Floyd() {
int i, j, k;
for (k = 1; k <= n; k++) {
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (graf[i][j])
graf[i][j] = min(graf[i][j], graf[i][k] + graf[k][j]);
}
}
}
}
int main()
{
int i, j;
fin >> n;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
fin >> graf[i][j];
}
}
Roy_Floyd();
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
fout << graf[i][j] << ' ';
}
fout << '\n';
}
return 0;
}