A near linear shortest path algorithm for weighted undirected graphs

Author(s):  
Muhammad Aasim Qureshi ◽  
Mohd Fadzil Hassan ◽  
Sohail Safdar ◽  
Rehan Akbar
2005 ◽  
Vol 34 (6) ◽  
pp. 1398-1431 ◽  
Author(s):  
Seth Pettie ◽  
Vijaya Ramachandran

2009 ◽  
Vol 419-420 ◽  
pp. 557-560 ◽  
Author(s):  
Rui Li

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.


Sign in / Sign up

Export Citation Format

Share Document