Pagini recente » Cod sursa (job #425010) | Cod sursa (job #2926609) | Cod sursa (job #1655335) | Cod sursa (job #1103935) | Cod sursa (job #3155149)
#include <fstream>
using namespace std;
/**
* graf -> matricea ponderilor
* g[i][i] = 0
* g[i][j] = costul de la i la j
*
* (x, y) - noduri
* minCost(x, y)
*/
int main() {
ifstream read("royfloyd.in");
ofstream write("royfloyd.out");
int n, mat[100][100];
read >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
read >> mat[i][j];
}
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if ((mat[i][j] > mat[i][k] + mat[k][j] || mat[i][j]==0) && i != j && mat[i][k] != 0 && mat[k][j] != 0)
mat[i][j] = mat[i][k] + mat[k][j];
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
write << mat[i][j] << " ";
}
write << "\n";
}
return 0;
}