Pagini recente » Cod sursa (job #2848851) | Cod sursa (job #1662786) | Istoria paginii utilizator/razvamoga | Statistici Necula Ovidiu (kuhaku) | Cod sursa (job #647949)
Cod sursa(job #647949)
#include<stdio.h>
#include<time.h>
long a[20000][20000],d[60000],t[60000],n,m,r,v[60000];
void cit(){
int i,j,cost,k;
freopen("dijkstra.in","r",stdin);
scanf("%ld%ld",&n,&m);
r=1;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
a[i][j]=320000;
for(k=1;k<=m;k++){
scanf("%ld%ld%ld",&i,&j,&cost);
a[i][j]=cost;
}
fclose(stdin);
}
void rezolva(){
int i,k,min,j;
for(i=1;i<=n;i++){
d[i]=a[r][i];
if(a[r][i]<320000)
t[i]=r;
}
v[r]=1;
t[r]=0;
for(k=1;k<=n;k++){
min=320000;
for(i=1;i<=n;i++)
if(min>d[i]&&v[i]==0){
min=d[i];
j=i;
}
v[j]=1;
for(i=1;i<=n;i++)
if(v[i]==0&&d[i]>min+a[j][i]&&a[j][i]){
d[i]=min+a[j][i];
t[i]=j;
}
}
}
int main(){
clock_t start, stop;
float durata;
start=clock();
cit();
rezolva();
freopen("dijkstra.out","w",stdout);
for(int i=2;i<=n;i++)
if(d[i]==320000)
printf("%d ",0);
else
printf("%ld ",d[i]);
stop=clock();
durata=(1.0 * stop-start)/CLOCKS_PER_SEC;
//printf("\n%f\n", durata);
fclose(stdout);
return 0;
}