Pagini recente » Cod sursa (job #3241479) | Cod sursa (job #2569928) | Cod sursa (job #1716395) | Cod sursa (job #118375) | Cod sursa (job #2337650)
#include <iostream>
#include <fstream>
#define pinf 10000010
using namespace std;
int a[103][103], n;
ofstream g("royfloyd.out");
ifstream f("royfloyd.in");
void citire()
{
int i,j;
double c;
f>>n;
//intiliazam matricea costurilor
// for(i=1;i<=n;i++)
// for(j=1;j<=n;j++)
// if(i==j) a[i][j]=0;
// else a[i][j]=pinf;
//citim matricea costurilor
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>a[i][j];
if(a[i][j]==0 && i!=j) a[i][j]=pinf;
}
}
void Floyd_Warshall()
{
int i,j,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]) a[i][j]=a[i][k] + a[k][j];
}
void afiseaza()
{
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(a[i][j]==pinf) g<<0;
else g<<a[i][j]<<" ";
g<<endl;
}
}
int main()
{
citire();
Floyd_Warshall();
afiseaza();
f.close();
g.close();
return 0;
}