A combinatorial algorithm of integrated navigation by using hierarchical strategy
Zhengkai Xu · Computer Knowledge and Technology · 2008
Shortest path algorithm has attracts significant attention in many fields such as computer science, operation research, geographic information and road traffic guide systems. Dijkstra's shortest path algorithm is one kind algorithm by which the optimum solution or the shortest path between one point and all others can be calculated. However, the performance of this algorithm is generally degraded due to its low efficiency. Based on Dijkstra algorithm, the combinatorial algorithm calculates the shortest path via a hierarchical strategy. Many critical issues such as large data size, low operation efficiency and resource-consuming problem, can all be solved by this algorithm.