Pagini recente » Cod sursa (job #1346411) | Cod sursa (job #35477) | Cod sursa (job #1580425) | Cod sursa (job #2084335) | Cod sursa (job #745096)
Cod sursa(job #745096)
//Include
#include <fstream>
using namespace std;
//Constante
const int MAX_SIZE = 101;
//Variabile
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int nodes;
int adiacence[MAX_SIZE][MAX_SIZE];
//Main
int main()
{
in >> nodes;
for(int i=1 ; i<=nodes ; ++i)
for(int j=1 ; j<=nodes ; ++j)
in >> adiacence[i][j];
for(int k=1 ; k<=nodes ; ++k)
for(int i=1 ; i<=nodes ; ++i)
{
if(i==k)
continue;
for(int j=1 ; j<=nodes ; ++j)
if(adiacence[k][i] + adiacence[i][j] < adiacence[k][j])
adiacence[k][j] = adiacence[k][i] + adiacence[i][j];
}
for(int i=1 ; i<=nodes ; ++i, out << '\n')
for(int j=1 ; j<=nodes ; ++j)
out << adiacence[i][j] << ' ';
in.close();
out.close();
return 0;
}