Pagini recente » Cod sursa (job #76120) | Cod sursa (job #2224687) | Cod sursa (job #420207) | Cod sursa (job #1537429) | Cod sursa (job #2918742)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int Nmax = 101;
int d[Nmax][Nmax];
int n;
int main()
{
int i, j, k;
in >> n; // numarul de noduri
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
in >> d[i][j];
}
}
// Roy-Floyd
for (k = 1; k <= n; k++) {
for(i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if ((d[i][j] > d[i][k] + d[k][j] || !d[i][j]) && i != j && d[i][k] != 0 && d[k][j] != 0) {
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
out << d[i][j] << " ";
}
out << '\n';
}
return 0;
}