Citation: | FU Meng-yin, LI Jie, ZHOU Pei-de. Design and Implementation of Bidirectional Dijkstra Algorithm[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2003, 12(4): 366-370. |
[1] |
Yue Yang,Gong Jianya.An efficient implementation ofshortest pat h algorit hm based on Dijkstra algorit hm[J] .Journal of Wuhan Technical University of Surveying andMapping,1999,24(3):209-212.(in Chinese)
|
[2] |
Lu Feng.Shortest pat h algorit hm:Taxonomy and advance in research[J] .Acta Geodaetica et CartographicaSinica,2001,30(3):269-275.(in Chinese)
|
[3] |
Yu Dongkai,Liu Yushu.Study on a routing algorit hmbased on ichnography[J] .Journal of Beijing Institute ofTechnology,2001,21(1):31-34.(in Chinese)
|
[4] |
Tang Wenwu,Shi Xiaodong,Zhu Dakui.The calculation of t he shortest pat h using modified Dijkstra algorit hmin GIS[J] .Journal of Image and Graphics,2000,5(12):1019-1023.(in Chinese)
|
[5] |
Dijkstra E W.A note on two problems in connection wit hgraphs[J] .Numerical Mat hematics,1959(1):269-271.
|
[6] |
Su Yongyun,Yan Kefei,Huang Xiang,et al.Study oft he met hod to search dynamic optimum route for vehiclenavigation system[J] .Systems Engineering,2000,18(4):32-37.(in Chinese)
|