Pagini recente » Cod sursa (job #1880367) | Cod sursa (job #1172493) | Rating Lazar Andrei (Beleaua) | Cod sursa (job #995502) | Cod sursa (job #2214847)
#include <iostream>
#include <fstream>
using namespace std;
int a[100][100];
int n, m , i , j;
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]!=0 && i!=j)
{if(a[i][j] > a[i][k] + a[k][j])
a[i][j]= a[i][k]+ a[k][j];}
else a[i][j]==0;
}
int main()
{
ifstream f("royfloyd.in");
f>>n;
for (i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
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++)
g<<a[i][j]<<" ";
g<<endl;
}
}