Pagini recente » Cod sursa (job #2452124) | Cod sursa (job #2452095) | Cod sursa (job #1866883) | Rating Vartolomei Dumitru-Vlad (hatton666) | Cod sursa (job #2214862)
#include <iostream>
#include <fstream>
using namespace std;
int a[101][101];
int n, i , j, INF=1000000;
void floydwarsh()
{ int k;
for (k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{if(a[i][j] > a[i][k] + a[k][j] && i!=j)
a[i][j]= a[i][k]+ a[k][j];}
}
int main()
{
ifstream f("royfloyd.in");
f>>n;
for (i=1;i<=n;i++)
{for(j=1;j<=n;j++)
{f>>a[i][j];
if(a[i][j]==0)
a[i][j]=INF;
}
}
for (i=1;i<=n;i++)
{for(j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;}
cout<<endl;
ofstream g("royfloyd.out");
floydwarsh();
for (i=1;i<=n;i++)
{for(j=1;j<=n;j++)
if(a[i][j]==INF)
g<<0<<" ";
else
g<<a[i][j]<<" ";
g<<endl;
}
}