| 基于Dijkstra的最短路径改进算法 |
| |
| 引用本文： | 罗理,王锋. 基于Dijkstra的最短路径改进算法[J]. 湖北汽车工业学院学报, 2007, 21(2): 22-25 |
| |
| 作者姓名： | 罗理 王锋 |
| |
| 作者单位： | 昆明理工大学,信息工程与自动化学院,云南,昆明,650051;昆明理工大学,信息工程与自动化学院,云南,昆明,650051 |
| |
| 摘 要： | 针对如何利用Dijkstra算法来高效地查找图中任意两结点之间的最短路径这一问题,提出了2种优化方法:其一是应用图中各结点的出入度来简化查找任意两结点之间的最短路径;其二是利用已求出的两点之间的最短路径来快速获得其他结点之间的最短路径。
|
| 关 键 词： | 最短路径 最短路径算法 Dijkstra算法 出入度 |
| 文章编号： | 1008-5483（2007）02-0022-04 |
| 收稿时间： | 2007-03-16 |
| 修稿时间： | 2007-03-16 |
Improved Algorithm of Shortest Path Based on Dijkstra |
| |
| Luo Li,Wang Feng. Improved Algorithm of Shortest Path Based on Dijkstra[J]. Journal of Hubei Automotive Industries Institute, 2007, 21(2): 22-25 |
| |
| Authors: | Luo Li Wang Feng |
| |
| Affiliation: | College of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 65005, China |
| |
| Abstract: | Aiming at the problem of how to more effectively find the shortest path between arbitrary two nodes in graph by the algorithm of Dijkstra,the two optimized methods were brought forward,which were applying out-in degree of nodes in the graph to simplify the search of the shortest path between arbitrary two nodes and making use of gained already the shortest path between two nodes to gain rapidly the shortest path among the other nodes. |
| |
| Keywords: | shortest path algorithm of the shortest path algorithm of Dijkstra out-in degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
