Pagini recente » Cod sursa (job #400840) | Cod sursa (job #31703) | Cod sursa (job #1027962) | Cod sursa (job #401915) | Cod sursa (job #1404669)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
vector< vector<unsigned int> > graf;
int n;
void citire(){
f >> n;
graf.resize(n+1, vector<unsigned int>(n+1));
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
f >> graf[i][j];
f.close();
}
void floyd_Warshall(){
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(graf[i][k] && graf[k][j] && (graf[i][j] > graf[i][k] + graf[k][j] || graf[i][j] == 0) && i!=j) graf[i][j] = graf[i][k] + graf[k][j];
}
void afisare(){
for(int i = 1; i <= n; ++i, g << "\n")
for(int j = 1; j <= n; ++j)
g << graf[i][j] << " ";
g.close();
}
int main(){
citire();
floyd_Warshall();
afisare();
return 0;
}