Pagini recente » tema | Cod sursa (job #767823) | Cod sursa (job #2432403) | Cod sursa (job #2135922) | Cod sursa (job #550969)
Cod sursa(job #550969)
#include<iostream.h>
#include<fstream.h>
int a[100][100],n,i,j,k;
void citire()
{
ifstream f;
f.open("royfloyd.in");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
f.close();
}
void floyd()
{
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]!=0 && a[k][j]!=0 || (a[i][k]+a[k][j]<a[i][j] && i!=j) && a[i][j]==0)
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
ofstream g;
g.open("royfloyd.out");
citire();
floyd();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;
}
g.close();
}