Pagini recente » Cod sursa (job #2254249) | Cod sursa (job #674786) | Cod sursa (job #1836966) | Cod sursa (job #2030095) | Cod sursa (job #2400977)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int c[120][120],succ[120][120],k,i,j,n;
void royfloyd()
{
for(k=1; k<=n; ++k)
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
if((c[i][j]>c[i][k]+c[k][j]||c[i][j]==0)&&i!=j&&c[i][k]&&c[k][j])
{
c[i][j]=c[i][k]+c[k][j];
}
}
void afis()
{
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
{
g<<c[i][j]<<" ";
}
g<<'\n';
}
}
int main()
{
f>>n;
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
f>>c[i][j];
royfloyd();
afis();
return 0;
}