【摘要】 在分析传统Dijkstra算法的基础上,提出该算法实现方法存在的缺点,继而提出一种基于Dijkstra算法的优化算法-优先队列算法,在搜索最小的节点时,该算法的时间复杂度大大降低,具有较好适用性.更多还原

【Abstract】 This paper analyses the classical Dijkstra algorithm and its disadvantages.The paper emphasizes an optimization algorithm of shortest paths,namely,the algorithm of priority queue,when searching the smallest nodes,the time complexity of the algorithm is reduced significantly.更多还原