Pagini recente » Cod sursa (job #654290) | Cod sursa (job #2384017) | Cod sursa (job #1338683) | Cod sursa (job #2435996) | Cod sursa (job #1358109)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int c[101][101];
void Floyd_Warshall();
int main()
{
fin >> n;
for ( int i = 1; i <= n; ++i )
for ( int j = 1; j <= n; ++j )
fin >> c[i][j];
Floyd_Warshall();
for ( int i = 1; i <= n; ++i )
{
for ( int j = 1; j <= n; ++j )
fout << c[i][j] << ' ';
fout << '\n';
}
fin.close();
fout.close();
return 0;
};
void Floyd_Warshall()
{
for (int k = 1; k <= n; k++)
for ( int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if ( c[i][k] && c[k][j] && (c[i][j] > c[i][k] + c[k][j] || !c[i][j]) && i != j )
c[i][j] = c[i][k] + c[k][j];
}