Pagini recente » Cod sursa (job #2269203) | Cod sursa (job #1264031) | Cod sursa (job #3207710) | Cod sursa (job #34401) | Cod sursa (job #3171537)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101], d[101][101], prev[101];
void royfloyd(int n) {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (a[i][j]) d[i][j] = a[i][j];
else if (i != j) d[i][j] = INT_MAX;
}
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
int main() {
int n;
f>>n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) f>>a[i][j];
}
royfloyd(n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) g<<d[i][j]<<" ";
g<<endl;
}
return 0;
}