Pagini recente » Cod sursa (job #2647318) | Cod sursa (job #1439878) | Cod sursa (job #1354167) | Cod sursa (job #1628788) | Cod sursa (job #1207713)
#include <iostream>
#include <fstream>
using namespace std;
ifstream ka("royfloyd.in");
ofstream ki("royfloyd.out");
const int N_MAX = 100;
int distante[N_MAX][N_MAX];
int n;
void floyd_warshall()
{
for(int i = 0; i < n; i++)
distante[i][i] = 0;
for(int k = 0; k < n; k++)
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
if(distante[i][k] + distante[k][j] < distante[i][j])
distante[i][j] = distante[i][k] + distante[k][j];
}
int main()
{
ka >> n;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
distante[i][j] = 0x3fffffff;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
{
ka >> distante[i][j];
if(distante[i][j] == 0)
distante[i][j] = 0x3fffffff;
}
floyd_warshall();
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
if(distante[i][j] == 0x3fffffff)
ki << 0 << " ";
else
ki << distante[i][j] << " ";
ki << '\n';
}
}