Pagini recente » Cod sursa (job #2842543) | Istoria paginii utilizator/dianad13 | Cod sursa (job #943925) | Istoria paginii utilizator/nekedfutok | Cod sursa (job #1383555)
#include<iostream>
#include<fstream>
using namespace std;
int a[100][100],n,l[100][100];
ifstream f1("royfloyd.in");
ofstream f2("royfloyd.out");
void cit() {f1>>n;int x,y;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
{f1>>a[i][j];l[i][j]=a[i][j];}
}
void nr() {
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (l[i][j]==0 and i!=j) l[i][j]=1001;//maxim
}
void warshall() {
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (l[i][j]>l[i][k]+l[k][j])
l[i][j]=l[i][k]+l[k][j];
}
void afis() {
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
f2<<l[i][j]<<" ";
f2<<'\n';
}
}
int main() {cit();nr();warshall();afis();}