Pagini recente » Cod sursa (job #391822) | Cod sursa (job #888326) | Cod sursa (job #3262737) | Cod sursa (job #1404225) | Cod sursa (job #3271960)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void Floyd_Warshall(int noNodes, vector<vector<int> > &arr) {
for(int k=1; k<=noNodes; k++) {
for(int i=1; i<=noNodes; i++) {
for(int j=1; j<=noNodes; j++) {
if(i == j)
continue;
if(arr[i][j] > arr[i][k] + arr[k][j])
arr[i][j] = arr[i][k] + arr[k][j];
}
}
}
}
int main() {
int noNodes;
fin >> noNodes;
vector<vector<int> > arr(noNodes+1, vector<int>(noNodes+1));
for(int i=1; i<=noNodes; i++) {
for(int j=1; j<=noNodes; j++) {
fin >> arr[i][j];
if(i != j && arr[i][j] == 0)
arr[i][j] = 2e9;
}
}
Floyd_Warshall(noNodes, arr);
for(int i=1; i<=noNodes; i++) {
for(int j=1; j<=noNodes; j++) {
fout << arr[i][j] << ' ';
}
fout << endl;
}
return 0;
}