Pagini recente » Cod sursa (job #638219) | Cod sursa (job #1901233) | Cod sursa (job #964776) | Cod sursa (job #947839) | Cod sursa (job #792077)
Cod sursa(job #792077)
#include <iostream>
#include <fstream>
using namespace std;
int M[105][105];
int n;
void floyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(M[i][k]+M[k][j]<M[i][j] && i!=j)
M[i][j]=M[i][k]+M[k][j];
return;
}
int main()
{
ifstream f;
ofstream g;
f.open("royfloyd.in");
g.open("royfloyd.out");
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>M[i][j];
floyd();
for(int i=1;i<=n;i++,g<<"\n")
for(int j=1;j<=n;j++)
g<<M[i][j]<<" ";
return 0;
}