Pagini recente » Cod sursa (job #443944) | Cod sursa (job #1672314) | Cod sursa (job #1311238) | Rating Oda John (OdaJohn) | Cod sursa (job #2425391)
#include <iostream>
#include <fstream>
const int COST_MAX = 999999999;
void royfloyd(int n, int** dist)
{
for(int k = 0; k < n; k++)
{
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(dist[i][j] > dist[i][k] + dist[k][j])
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
int main()
{
std::ifstream fin("royfloyd.in");
std::ofstream fout("royfloyd.out");
if(!fin.is_open() || !fout.is_open())
return -1;
int n = 0;
int** graf = nullptr;
fin >> n;
graf = new int* [n];
for(int i = 0; i < n; i++)
{
graf[i] = new int[n];
for(int j = 0; j < n; j++)
{
fin >> graf[i][j];
if(i == j) graf[i][j] = 0;
else if(graf[i][j] == 0) graf[i][j] = COST_MAX;
}
}
royfloyd(n, graf);
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
fout << (graf[i][j] == COST_MAX ? 0 : graf[i][j]) << ' ';
}
fout << '\n';
}
for(int i = 0; i < n; i++)
delete[] graf[i];
delete[] graf;
return 0;
}