| 基于数据结构的最短路径算法的研究 |
| |
| 引用本文： | 卢金昊,董驰.基于数据结构的最短路径算法的研究[J].价值工程,2012,31(10):195. |
| |
| 作者姓名： | 卢金昊 董驰 |
| |
| 作者单位： | 1. 东北石油大学秦皇岛分校,秦皇岛,066004
2. 东北石油大学石油工程学院,秦皇岛,066004 |
| |
| 基金项目： | 黑龙江省教育厅科学技术研究项目资助 |
| |
| 摘 要： | 基于数据结构的最短路径问题已成为研究图论中的热门课题之一。Dijkstra算法作为解决最短路径问题的基础理论,被广泛应用与工程计算中。本文针对传统Dijkstra算法存在的缺陷,提出优化方法,主要通过对最短路径结点的选取、数据的存储结构与组织进行了改进,经过比较分析,得出改进后的算法,降低了存储空间,有效提高了运行效率,在最短路径计算中具有更好的适用性。
|
| 关 键 词： | 数据结构 最短路径 Dijkstra算法 |
Research on Shortest Path Algorithm Based on Data Structure |
| |
| Lu Jinhao
,
Dong Chi.Research on Shortest Path Algorithm Based on Data Structure[J].Value Engineering,2012,31(10):195. |
| |
| Authors: | Lu Jinhao Dong Chi |
| |
| Institution: | (①Northeast Petroleum University Qinhuangdao Branch,Qinhuangdao 066004,China;②Northeast Petroleum University College of Petroleum Engineering,Qinhuangdao 066004,China)① Lu Jinhao;② Dong Chi |
| |
| Abstract: | The shortest path based on the data structure has become one of the hot research topic in graph theory.Dijkstra shortest path algorithm has been widely used in engineering calculations as the basic theory of solving the problem.Compared to the shortcomings of traditional Dijkstra algorithm,it has proposed optimization method in this thesis,it has been improved mainly through the nodes of the shortest path selection,data storage and organization structure.Through comparative analysis,the improved algorithm has reduced storage space and improved operational efficiency,and it has a better applicability in the shortest path calculation. |
| |
| Keywords: | data structure shortest path Dijkstra algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
