Cod sursa(job #2288226)
| Utilizator | Data | 22 noiembrie 2018 22:45:48 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
int m,i,o,n,d[50001],a[250000],b[250000],c[250000];
int main() {
freopen("dijkstra.in","r",stdin),freopen("dijkstra.out","w",stdout),scanf("%d%d",&n,&m);
for(i=0;i<m;i++)
scanf("%d%d%d",a+i,b+i,c+i);
for(i=2;i<=n;i++)
d[i]=N;
while(!o) {
for(o=1,i=0;i<m;i++)
if(d[b[i]]>d[a[i]]+c[i])
o=0,d[b[i]]=d[a[i]]+c[i];
}
for(i=2;i<=n;i++)
printf("%d ",d[i]==N?0:d[i]);
}
