Pagini recente » Cod sursa (job #3283413) | Cod sursa (job #1367755) | Cod sursa (job #369289) | Cod sursa (job #1402273) | Cod sursa (job #1076508)
#include <fstream>
#include <iostream>
using namespace std;
#define PInfinit 1.e20
int n,a[101][101];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void Citire()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>a[i][j];
}
void Lungime_Drumuri()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j) a[i][j]=a[i][k]+a[k][j];
}
void Drum(int i, int j)
{
int gasit=0,k;
for(k=1;((k<=n) && (!gasit));k++)
{
if(i!=k && j!=k && a[i][j]==a[i][k]+a[k][j])
{
Drum(i,k);Drum(k,j);
gasit=1;
}
}
if(!gasit) cout<<j<<' ';
}
void Scriu_Drum(int Nod_Initial, int Nod_Final)
{
int i,j;
if(a[i][j])
{
cout<<"Drumul de la "<<Nod_Initial<<" la "<<Nod_Final<<" are costul de "<<a[Nod_Initial][Nod_Final]<<'\n'<<Nod_Initial<<' ';
Drum(Nod_Initial,Nod_Final);
}
}
void Afisare()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fout<<a[i][j]<<' ';
fout<<'\n';
}
}
int main()
{
Citire();
Lungime_Drumuri();
Afisare();
}