3Xu M H,Liu Y Q,Huang Q L,et al. An improved Dijkstra's shortest path algorithm for sparse network [ J ]. Applied Mathematics and Computation,2007,185 ( 1 ) : 247 - 254.
4Berghammer R. Combining relational calculus and the Dijkstra - Giles method for deriving relational programs [ J ]. Information Sciences,1999,119(3 -4) : 155 - 171.
5Misra J. A walk over the shortest path: Dijkstra's Algorithm viewed as fixed - point computation [ J ]. Information Processing Letters 2001,77(2 -4) : 197 -200.
6Solka J L, Perry J C, Poellinger B R, et al. Fast computation of opti- mal paths using a parallel Dijkstra algorithm with embedded constraints[J]. Neurocomputing,1995,8(2) : 195 -212.
7Gibbons H. Definite descriptions and dijkstra's odd powers of odd integers problem [ J ]. Electronic Notes in Theoretical Computer Science ,2009,225 ( 2 ) : 83 - 98.
8Peyer S, Rautenbach D, Vygen J. A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing[ J ]. Journal of Discrete Algorithms,2009,7 (4) : 377 - 390.
9Soltani A R, Tawfik H, Goulermas J Y, et al. Path planning in con- struction sites: performance evaluation of the Dijkstra, A * , and GA search algorithms [ J ]. Advanced Engineering Informatics, 2002,16(4) : 291 -303.
