| 最短路权矩阵法的改进 |
| |
| 引用本文： | 孙小军,焦建民.最短路权矩阵法的改进[J].计算机工程与设计,2008,29(5):1157-1159. |
| |
| 作者姓名： | 孙小军 焦建民 |
| |
| 作者单位： | 宝鸡文理学院数学系,陕西,宝鸡,721013 |
| |
| 基金项目： | 陕西省自然科学基础研究计划 |
| |
| 摘 要： | 最短路权矩阵法是通过权矩阵计算来实现Dijkstra算法的一种方法.针对权矩阵法在大型网络应用中的不足,从提高算法效率和增强寻路直观性两个方面对其进行了改进,并给出了新的算法.新算法既能快速计算最短路权又能更直观地找出网络中的最短路,是一种计算最短路的简捷方法.仿真结果和算例表明了新算法的有效性.
|
| 关 键 词： | 网络 最短路 权矩阵 Dijkstra算法 标号数组 |
| 文章编号： | 1000-7024(2008)05-1157-03 |
| 修稿时间： | 2007年4月3日 |
Improvement on weight matrix method for shortest-paths problem |
| |
| SUN Xiao-jun,JIAO Jian-min.Improvement on weight matrix method for shortest-paths problem[J].Computer Engineering and Design,2008,29(5):1157-1159. |
| |
| Authors: | SUN Xiao-jun JIAO Jian-min |
| |
| Affiliation: | SUN Xiao-jun,JIAO Jian-min(Department of Mathematics,Baoji College of Arts , Science,Baoji 721013,China) |
| |
| Abstract: | The weight matrix method for the shortest-paths problem is one of the methods of carrying out the Dijkstra algorithm though weight matrix calculating.To correct the shortcomings of weight matrix method for the shortest-paths problem,a new algorithm is pre-sented,which is obtained by improving the efficiency of weight matrix method and enhancing observation for finding shortest-paths.Since it can both calculate shortest-path weights more quickly and find shortest paths more directly,the new algorithm is a si... |
| |
| Keywords: | network shortest-path weight matrix Dijkstra algorithm label array |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
