Cod sursa(job #586749)

Utilizator iulishorIulian Popescu iulishor Data 2 mai 2011 20:56:20
Problema Algoritmul lui Dijkstra Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 1.07 kb
#include<fstream>
#define inf 1000
using namespace std;
int n;
int c[500][500];
int pre[500],m[500];
int d[500];
void initializare();
void afisare();
int main()
{
	int i,vfmin,j;
	int 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];
			}
	}
	afisare();
}
void initializare()
{
	int i,j,mm,x,y;
	int cc;
	ifstream f("dijkstra.in");
	f>>n>>mm;
	for(i=1;i<=n;++i)
		for(j=i+1;j<=n;++j)
			c[j][i]=c[i][j]=inf;
		for(i=1;i<=mm;++i)
		{
			f>>x>>y>>cc;
			c[x][y]=cc;
		}
		for(i=1;i<=n;++i)
		{
			d[i]=c[1][i];
			pre[i]=1;
		}
		m[1]=1;
		pre[1]=0;
}
void afisare()
{
	ofstream g("dijkstra.out");
	int i;
	for(i=1;i<=n;++i)
		if(i!=1)
		{
			g<<d[i]<<" ";
			/*dr[0]=i;
			lg=0;
			while(pre[dr[lg]])
			{
				++lg;
				dr[lg]=pre[dr[lg-1]];
			}
			for(j=lg;j>=0;--j)
				g<<dr[j]<<" ";
			g<<"\n";*/
		}
}