Cod sursa(job #687117)

Utilizator iuli1505Parasca Iuliana iuli1505 Data 22 februarie 2012 09:09:32
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include<cstdio>
using namespace std;
#define inf 10000003
#define nrmax 50010
int n,mn,x,y,i,j,c;
int a[nrmax][nrmax],pre[nrmax],d[nrmax],m[nrmax];
void citire()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	scanf("%d%d", &n, &mn);
	for(i=1;i<=n;i++)
		for(j=i+1;j<=n;j++)
			a[i][j]=a[j][i]=inf;
	for(i=1;i<=mn;i++)
	{
		scanf("%d%d%d", &x, &y, &c);
		a[x][y]=c;
	}
	for(i=1;i<=n;i++)
	{
		d[i]=a[1][i];
		pre[i]=1;
	}
	m[1]=1;
	pre[1]=0;
}
int main()
{
	int i,j,vf,dmin;
	citire();
	for(j=1;j<n;j++)
	{
		dmin=inf;
		for(i=2;i<=n;i++)
			if(!m[i]&&dmin>d[i])
			{
				dmin=d[i];
				vf=i;
			}
		m[vf]=1;
		for(i=2;i<=n;i++)
			if(!m[i]&&d[i]>dmin+a[vf][i])
			{
				pre[i]=vf;
				d[i]=dmin+a[vf][i];
			}
	}
	for(i=2;i<=n;i++)
		printf("%d ", d[i]);
	return 0;
}