Cod sursa(job #2423463)

Utilizator GashparzPredescu Eduard-Alexandru Gashparz Data 21 mai 2019 14:10:26
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.72 kb
///Roy-Floyd SAU FLoyd-Warshall
#include <iostream>
#include <fstream>

using namespace std;

int m[10005][10005];///m este Dist
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 << m[i][j] << " ";
		fout << "\n";
	}
	return 0;
}