Cod sursa(job #422512)

Utilizator fa_reeaFelcher Andreea-Alexandra fa_reea Data 22 martie 2010 19:37:38
Problema Algoritmul lui Dijkstra Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include<iostream.h>
#include<fstream.h>
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int a[50][50],d[51],tata[51],viz[51],i,j,c,min,n,m,k;
const int inf=32000;
void citire(){
	f>>n>>m;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			if(i==j) a[i][j]=0;
		else a[i][j]=inf;
	for(k=1;k<=m;k++){
		f>>i>>j>>c;
	    a[i][j]=c;
	}
}
int main(){
	citire();
	for(i=1;i<=n;i++){
		d[i]=a[1][i];
		if(d[i]<inf) tata[i]=1;
	}
	tata[1]=0;
	viz[1]=1;
	for(k=1;k<n;k++){
		min=inf;
		for(i=1;i<=n;i++)
			if(d[i]<min&&!viz[i])
				{min=d[i];
			     j=i;
				}
		viz[j]=1;
	for(i=1;i<=n;i++)		
       if(!viz[i]&&d[i]>d[j]+a[j][i])	
		   {d[i]=d[j]+a[j][i];
	        tata[i]=j;
		   }
	}
for(i=2;i<=n;i++)
		if(d[i]!=inf) g<<d[i]<<" ";
f.close();
return 0;
}