Pagini recente » Cod sursa (job #2427421) | Cod sursa (job #2423499) | Cod sursa (job #2424911) | Cod sursa (job #2691907) | Cod sursa (job #2423462)
///Roy-Floyd SAU FLoyd-Warshall
#include <iostream>
#include <fstream>
using namespace std;
int m[10005][10005];
int noduri;
void roy()
{
for (int k = 1; k <= noduri; k++)
for (int i = 1; i <= noduri; i++)
for (int j = 1; j <= noduri; j++)
if (m[i][k] && m[k][j] && (m[i][k] > m[i][j] + m[k][j] || !m[i][j]) && i != j)
m[i][j] = m[i][k] + m[k][j];
}
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> noduri;
for (int i = 1; i <= noduri; i++)
for (int j = 1; j <= noduri; j++)
fin >> m[i][j];
roy();
for (int i = 1; i <= noduri; i++)
{
for (int j = 1; j <= noduri; j++)
fout << g[i][j] << " ";
fout << "\n";
}
return 0;
}