一种基于道路网分层的最短路径算法

A Shortest Path Algorithm Based on Road Subdivision

D ijkstra算法是求解最短路径的经典算法,A*是目前最流行的启发式搜索算法,分析了这两种算法的搜索空间和时间复杂度。在此基础上,提出了一种基于道路网分层最短路径算法。实验证明:该算法是一种效率好、实用性强的最短路径算法。

Dijkstra is a classic method for the shortest-path analysis and A ＊ is a popular heuristic arithmetic. We analyzed the searching space and calculation time-complexity of the two existing algorithm, then designed a shortest-path algorithm based on road subdivision. The results show that the algorithm is provided with high efficiency and great practicability.