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

Abstract:

Article Preview

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.

Info:

Periodical:

Key Engineering Materials (Volumes 419-420)

Edited by:

Daizhong Su, Qingbin Zhang and Shifan Zhu

Pages:

557-560

DOI:

10.4028/www.scientific.net/KEM.419-420.557

Citation:

R. Li "Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS", Key Engineering Materials, Vols. 419-420, pp. 557-560, 2010

Online since:

October 2009

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.