Pagini recente » Cod sursa (job #1275174) | Cod sursa (job #123832) | Cod sursa (job #168339) | Cod sursa (job #2813792) | Cod sursa (job #2890864)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int graph[105][105];
void RoyFloyd() {
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (graph[k][j] + graph[i][k] < graph[i][j] && graph[i][k] && graph[k][j]) {
graph[i][j] = graph[k][j] + graph[i][k];
}
}
}
}
}
int main() {
fin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fin >> graph[i][j];
if (graph[i][j] == 0 && i != j) {
graph[i][j] = 0x3f3f3f3f;
}
}
}
RoyFloyd();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fout << graph[i][j] << ' ';
}
fout << '\n';
}
}