Pagini recente » Cod sursa (job #2456389) | Cod sursa (job #3191499) | Cod sursa (job #2382047) | Cod sursa (job #1480826) | Cod sursa (job #2202168)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,adiac[105][105],mat[105][105];
void parcurgere()
{
int ok;
for (int k=1; k<=n; k++)
{
ok=1;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
if (i==k || j==k)
continue;
else
{
adiac[i][j]=min(adiac[i][j],adiac[i][k]+adiac[k][j]);
}
}
}
}
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
g << adiac[i][j] <<' ';
g << '\n';
}
}
int main()
{
f >> n;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
f >> adiac[i][j];
if (adiac[i][j]==0 && i!=j)
adiac[i][j]=(1<<28);
}
}
parcurgere();
return 0;
}