Pagini recente » Cod sursa (job #2999815) | Cod sursa (job #3208820) | Cod sursa (job #1847790) | Cod sursa (job #880419) | Cod sursa (job #3264745)
#include<fstream>
#define INF 999999999
std::ifstream fin("royfloyd.in");
std::ofstream fout("royfloyd.out");
int G[105][105], sol[105][105];
int n;
void read()
{
fin>>n;
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
{
fin>>G[i][j];
sol[i][j]=(G[i][j]==0)?INF:G[i][j];
}
for(int i=1; i<=n; ++i)
sol[i][i]=0;
}
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(sol[i][j]>sol[i][k]+sol[k][j] && sol[i][k]!=INF && sol[k][j]!=INF)
sol[i][j]=sol[i][k]+sol[k][j];
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
{
if(sol[i][j]==INF)
sol[i][j]=0;
fout<<sol[i][j]<<' ';
}
fout<<'\n';
}
}
int main()
{
read();
floyd_warshall();
return 0;
}