Pagini recente » Cod sursa (job #659872) | Cod sursa (job #2953849) | Cod sursa (job #2908259)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
const int N = 101, INF = 1e6;
int d[N][N], n;
int main()
{
fin >> n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
fin >> d[i][j];
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (i != j && d[i][j] == 0)
d[i][j] = INF;
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (d[i][k] + d[k][j] < d[i][j])
{
d[i][j] = d[i][k] + d[k][j];
//pred[i][j] = pred[k][j]; pemtru reconstituirea drumului
}
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
fout << d[i][j] << " ";
fout << endl;
}
return 0;
}