Pagini recente » Cod sursa (job #52972) | Cod sursa (job #2519768) | Cod sursa (job #2267762) | Cod sursa (job #867752) | Cod sursa (job #1010852)
#include <fstream>
#define NMAX=105
using namespace std;
ifstream f("royfloyd.in");
ofstream f("royfloyd.out");
int n,a[NMAX][NMAX];
void citire()
{
f>>n;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
f>>a[i][j];
}
}
void royfloyd()
{
for (int k=1; k<=n; k++)
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
if (a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j)
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
void afisare()
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
g<<a[i][j]<<" ";
g<<"\n";
}
}
int main ()
{
citire();
royfloyd();
afisare();
f.close();
g.close();
return 0;
}