Pagini recente » Cod sursa (job #197745) | Cod sursa (job #289766) | Cod sursa (job #2242591) | Cod sursa (job #157482) | Cod sursa (job #382212)
Cod sursa(job #382212)
#include <fstream>
using namespace std;
int n, a[105][105];
ofstream g ("royfloyd.out");
ifstream f ("royfloyd.in");
void citire()
{
int i, j;
f>>n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) f>>a[i][j];
}
void floyd()
{
int i, j, k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
}
void afisare()
{
int i, j;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
g<<a[i][j]<<" ";
g<<endl;
}
}
int main()
{
citire();
floyd();
afisare();
return 0;
}