Pagini recente » Cod sursa (job #1741228) | Cod sursa (job #2529268) | Cod sursa (job #2234677) | Cod sursa (job #1299138) | Cod sursa (job #1614054)
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 101;
int graf[NMAX][NMAX];
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
void citire()
{
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>graf[i][j];
in.close();
}
void roy()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=k && i!=j && graf[i][k] + graf[k][j] < graf[i][j])
graf[i][j] = graf[i][k] + graf[k][j];
}
void afisare()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
out<<graf[i][j]<<" ";
out<<"\n";
}
}
int main()
{
citire();
roy();
afisare();
out.close();
return 0;
}