Cod sursa(job #662965)

Utilizator federerUAIC-Padurariu-Cristian federer Data 17 ianuarie 2012 15:42:16
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include<fstream>
#define NMaxVf 10001
#define Inf 10001
using namespace std;

int n, x0;
double C[NMaxVf][NMaxVf];
int pre[NMaxVf], M[NMaxVf];
double d[NMaxVf];

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

void initializare()
{
	int i, j, m, x, y;
	double c;
	fin>>n>>m>>x0;
	for(i=1;i<=n;i++)
		for(j=i+1;j<=n;j++)
			C[i][j]=C[j][i]=Inf;
	for(i=1;i<=m;i++)
	{
		fin>>x>>y>>c;
		C[x][y]=c;
	}
	for(i=1;i<=n;i++)
	{d[i]=C[x0][i], pre[i]=x0;}
	M[x0]=1;pre[x0]=0;
}

int main()
{
	int i, VfMin, j;
	double dMin;
	initializare();
	for(j=1;j<n;j++)
	{
		dMin=Inf;
		for(i=1;i<=n;i++)
			if(!M[i] && dMin>d[i])
			{
				dMin=d[i];
				VfMin=i;
			}
		M[VfMin]=1;
		for(i=1;i<=n;i++)
			if(!M[i] && d[i]>dMin+C[VfMin][i])
			{
				pre[i]=VfMin;
				d[i]=dMin+C[VfMin][i];
			}
	}
	for(i=1;i<=n;i++)
		fout<<d[i]<<' ';
	fout<<'\n';
	fin.close();
	fout.close();
	return 0;
}