Pagini recente » Cod sursa (job #2591865) | Cod sursa (job #2375082) | Cod sursa (job #2691561) | Cod sursa (job #378654) | Cod sursa (job #396626)
Cod sursa(job #396626)
#include<fstream>
using namespace std;
const int inf=1<<29;
int c[101][101],d[101][101];
int n;
void citire ()
{
int i,j;
ifstream fin("royfloyd.in");
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
fin>>c[i][j];
}
fin.close ();
}
void royfloyd()
{
int i,j,k;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if(c[j][i] && c[i][k] && (c[j][k] > c[j][i] + c[i][k] || !c[j][k]) && k!=j)
c[j][k]=min(c[j][k],c[j][i]+c[i][k]);
}
void scriere()
{
int i,j;
ofstream fout("royfloyd.out");
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<c[i][j]<<' ';
fout<<"\n";
}
}
int main ()
{
citire();
royfloyd();
scriere();
return 0;
}