Cod sursa(job #591996)

Utilizator elielisorElena Eli elielisor Data 26 mai 2011 11:25:23
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#include<fstream>
using namespace std;
#define PInfinit 1000000
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
float a[500][500];
int n,i,j;
void drum(int i, int j)
{
	int k=1,gasit=0;
	while((k<=n)&&!gasit)
	{
		if((i!=k)&&(j!=k)&&(a[i][j]==a[i][k]+a[k][j]))
		{
			drum(i,k);
			drum(k,j);
			gasit=1;
		}
		k++;
	}
	if(!gasit)
		g<<j<<" ";
}
void scriu_drum(int ni,int nf)
{
	if(a[ni][nf]<PInfinit)
	{
		g<<" Drumul de la "<<ni<<" la "<<nf<<" are lungimea "<<a[ni][nf]<<"\n";
		g<<ni<<" ";
		drum(ni,nf);
	}
		else
			g<<" Nu exista drum de la "<<ni<<" la "<<nf;
}
void lungime_drumuri()
{
	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];
}
int main()
{
	f>>n;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			f>>a[i][j];
	lungime_drumuri();
	//scriu_drum(1,4);
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
			g<<a[i][j]<<" ";
			g<<"\n";
	}
	return 0;
}