Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS

Abstract:

Shortest path is the core issue in application of WebGIS. Improving the efficiency of the algorithm is an urgent requirement to be resolved at present. By the lossy algorithm analyzing, which is the current research focus of the shortest path algorithm to optimize, utilizing adjacency table of storage structures, restricted direction strategy and binary heap technology to optimize the algorithm, thereby reduce the scale of algorithm to improve the operating efficiency of algorithm. This scheme has been applied in the simulation of the data downloaded from the Guangdong Provincial Highway Network Information System and satisfactory results have been obtained.

• Periodical: Key Engineering Materials (Volumes 419-420)
• Pages: 557-560
• DOI: https://doi.org/10.4028/www.scientific.net/KEM.419-420.557
• Online since: October 2009
• Authors: Rui Li
• Keywords: Binary Heap, Dijkstra Algorithm, Restricted Direction Strategy, Shortest Path, Web-GIS

References

[1] Chen Hong-ying, Yang Yi-min and Mao Ge-fei: Computer Engineering and Application Vol. 3 (2005), pp.208-211.

[2] Zhan F B: Journal of Geographic Information and Decision Analysis Vol. 1 (1997), pp.69-82.

[3] Yan Wei-min, Wu Wei-min: Data Structure(Tsinghua University Press, Beijing 2001).

[4] Si Lian-fa, Wang Wen-jing: Bulletin of Surveying and Mapping Vol. 8 (2005), p.15－18.

[5] Li Cong-xin, Meng Xiang-gang and Zhang Ying: Journal of Shaanxi Institute of Technology Vol. 2 (2005), pp.18-20.

[6] Zhu Jing: Computer and Modernization Vol. 9 (2005), pp.19-24.

[7] Hu Shu-wei, Zhang Xiu-ru and Zhao Yang: Computer Technology and Development Vol. 16 (2006), pp.49-54.