Pagini recente » Cod sursa (job #2437319) | Cod sursa (job #72284) | Cod sursa (job #1902214) | Cod sursa (job #3257686) | Cod sursa (job #860818)
Cod sursa(job #860818)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
vector< vector<unsigned int> > graf;
int n;
int minim(int a, int b){
if(a < b) return a;
return b;
}
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)
graf[i][j] = minim(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;
}