Pagini recente » Cod sursa (job #2390992) | Cod sursa (job #24402) | Cod sursa (job #456594) | Cod sursa (job #2198465) | Cod sursa (job #1713356)
#include <fstream>
using namespace std;
#define MAX 101
#define min(a, b) ((a < b) ? a : b)
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int N;
void Floyd_Warshall(int D[MAX][MAX]) {
int DNew[MAX][MAX];
for (int k = 1; k <= N; ++k) {
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j)
DNew[i][j] = min(D[i][j], D[i][k] + D[k][j]);
D = DNew;
}
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j)
out << D[i][j] << " ";
out << endl;
}
}
int main()
{
in >> N;
int D[MAX][MAX];
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j)
in >> D[i][j];
Floyd_Warshall(D);
return 0;
}