Pagini recente » Cod sursa (job #787197) | Cod sursa (job #131165) | Cod sursa (job #552841) | Cod sursa (job #597881) | Cod sursa (job #3242213)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, distance_matrix[105][105];
void read()
{
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
fin >> distance_matrix[i][j];
}
void roy_floyd()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (distance_matrix[i][k] && distance_matrix[k][j] && (distance_matrix[i][j] > distance_matrix[i][k] + distance_matrix[k][j] || !distance_matrix[i][j]) && i != j)
distance_matrix[i][j] = distance_matrix[i][k] + distance_matrix[k][j];
}
void afisare()
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
fout << distance_matrix[i][j] << ' ';
fout << '\n';
}
}
int main()
{
read();
roy_floyd();
afisare();
return 0;
}