Pagini recente » Cod sursa (job #2829172) | Cod sursa (job #1670094) | Cod sursa (job #2746428) | Cod sursa (job #360188) | Cod sursa (job #1808109)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
#define inf 1000000000
int n, m, a[101][101], pred[101][101];
void afis(int a[101][101]) {
int i, j;
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++)
g << (a[i][j] == inf ? 0 : a[i][j]) << ' ';
g<<'\n';
}
g<<'\n';
}
void cit_graf() {
int i, j;
f>>n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
{
f>>a[i][j];
if(!a[i][j] && i != j)
a[i][j] = inf;
}
}
void Roy_Floyd() {
int i, j, k;
for(k = 1; k <= n; k++) {
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(i != k && j != k && a[i][k] + a[k][j] < a[i][j])
{
a[i][j] = a[i][k] + a[k][j];
pred[i][j] = pred[k][j];
}
}
}
void traseu(int i, int j) {
if(a[i][j])
traseu(i, pred[i][j]);
g<<j<<' ';
}
int main()
{
cit_graf();
Roy_Floyd();
afis(a);
return 0;
}