Pagini recente » Cod sursa (job #1495190) | Cod sursa (job #2222426) | Cod sursa (job #3162031) | Cod sursa (job #3217179) | Cod sursa (job #2432123)
#include <fstream>
#define MAX 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,Dist[MAX][MAX];
void read();
void floydWarshall();
void print();
int main(){
read();
floydWarshall();
print();
return 0;
}
void floydWarshall(){
int i,j,k;
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(Dist[i][k]&&Dist[k][j]&&i!=j)
if(Dist[i][j])
Dist[i][j]=min(Dist[i][j],Dist[i][k]+Dist[k][j]);
else
Dist[i][j]=Dist[i][k]+Dist[k][j];
}
void print(){
int i,j;
for(i=1;i<=n;++i){
for(j=1;j<=n;++j)
fout<<Dist[i][j]<<' ';
fout<<'\n';
}
}
void read(){
int i,j;
fin>>n;
for(i=1;i<=n;++i){
for(j=1;j<=n;++j)
fin>>Dist[i][j];
}
}