节点文献
一种改进的Dijkstra算法的分析及程序实现
Program Implementation and Analysis on an Improved Dijkstra Algorithm
【摘要】 Dijkstra算法是求有向图中从某一源点到其余各点最短路径的算法。本文通过对传统的D ijkstra算法进行分析,提出一种改进算法,经理论分析,对于顶点数较多而边数较少的有向稀疏图来说,在求最短路径时能够大大提高算法的运行效率。
【Abstract】 Dijkstra algorithm is an algorithm for solving single-source shortest-paths of directed graph.This paper analyzes classical Dijkstra algorithm and puts forward an improved algorithm.By theoretical analysis,the improved algorithm can improve efficiency of directed sparse graph.
- 【文献出处】 计算机与现代化 ,Computer and Modernization , 编辑部邮箱 ,2011年01期
- 【分类号】TP301.6
- 【被引频次】34
- 【下载频次】551