A shortest-path algorithm with expected time O(n2 log n log* n)

1980 ◽  
Author(s):  
Peter Bloniarz
Keyword(s):  
Shortest Path ◽  
Shortest Path Algorithm ◽  
Expected Time

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

2009 ◽  
Vol 419-420 ◽  
pp. 557-560 ◽  
Author(s):  
Rui Li
Keyword(s):  
Shortest Path ◽  
Operating Efficiency ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Research Focus ◽  
Network Information ◽  
The Core ◽  
Highway Network ◽  
Core Issue ◽  
Storage Structures

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.

scholarly journals Shortest path algorithm for optimal sectioning of hydrocarbon transport pipeline

2016 ◽  
Vol 49 (12) ◽  
pp. 532-537
Author(s):  
A. Cano-Acosta ◽  
John Fontecha ◽  
Nubia Velasco ◽  
Felipe Muñoz-Giraldo
Keyword(s):  
Shortest Path ◽  
Shortest Path Algorithm ◽  
Hydrocarbon Transport
Sign in / Sign up

Export Citation Format

Share Document