Pagini recente » Cod sursa (job #2224090) | Cod sursa (job #2374302) | Cod sursa (job #1774670) | Cod sursa (job #2626541) | Cod sursa (job #2207366)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
vector<vector<int>> graf;
void citeste() {
fin >> n; int x;
for (int i = 0; i < n; i++) {
vector<int>* row = new vector<int>;
for (int j = 0; j < n; j++) {
fin >> x;
if (i != j && x == 0) x = INT32_MAX;
row->push_back(x);
}
graf.push_back(*row);
}
}
void afisare(ostream& out = std::cout) {
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++) {
if (i!=j && graf[i][j] == INT32_MAX) out << 0 << " ";
else out << graf[i][j] << " ";
}
out << endl;
}
}
void royfloyd() {
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (graf[i][j] > graf[i][k] + graf[k][j])
graf[i][j] = graf[i][k] + graf[k][j];
}
}
int main() {
citeste();
royfloyd();
afisare(fout);
return 0;
}