基于Dijkstra的最短路径问题的算法分析与优化

摘要

Dijkstra算法是最具有代表性的最短路径算法，为解决许多工程领域中出现的最短路径问题提供了理论依据。本文分析了Dijkstra算法以及该算法存在的不足，并提出了优化该算法的方法，通过与原算法作比较，结果表明这种改进的算法在运行时间和效率上得到了提高，其占用的存储空间得到了减少。%The Dijkstra algorithm is the most representative of the shortest path algorithm, provides the theoretical basis for solving the shortest path problem in many engineering fields. This paper analyzes the deficiency of the Dijkstra algorithm and this algorithm, and presents a method of optimization of the algorithm, compared with the original algorithm, the results show that algorithm has been improved at run time and efficiency, the storage space are reduced.