Pagini recente » Cod sursa (job #356172) | Cod sursa (job #3216669) | Cod sursa (job #569521) | Cod sursa (job #145776) | Cod sursa (job #2542308)
#include<bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int node_count;
int distances[100][100];
void read()
{
in>>node_count;
for(int i=0; i<node_count; i++)
{
for(int k=0; k<node_count; k++)
{
in>>distances[i][k];
}
}
}
void royfloyd(){
int split;
for(int i=0;i<node_count;i++){
for(int j=0;j<node_count;j++){
for(int k=0;k<node_count;k++){
split=distances[j][i]+distances[i][k];
if(distances[j][k]>split)
distances[j][k]=split;
}
}
}
}
int main(){
read();
royfloyd();
for(int i=0; i<node_count; i++)
{
for(int k=0; k<node_count; k++)
{
out<<distances[i][k]<<" ";
}
out<<'\n';
}
return 0;
}