| 基于改进的Floyd算法求节点间所有最短路径 |
| |
| 引用本文： | 朱浩,张玉.基于改进的Floyd算法求节点间所有最短路径[J].电声技术,2011,35(12):65-67. |
| |
| 作者姓名： | 朱浩 张玉 |
| |
| 作者单位： | 解放军电子工程学院,安徽合肥,230037 |
| |
| 摘 要： | 网络节点间的最短路径可能不止一条.首先运用加速的Floyd算法得到最短路径长度矩阵；然后根据最短路径长度矩阵构造各个节点的到达距离矩阵,用来与最短路径长度矩阵进行对比；最后得到每个节点的后继节点,进而得到所有最短路径.计算机仿真验证了该算法的高效性.
|
| 关 键 词： | 网络 最短路径 Floyd算法 节点 |
Finding Shortest Paths between Nodes Based on Improved Floyd Algorithm |
| |
| ZHU Hao,ZHANG Yu.Finding Shortest Paths between Nodes Based on Improved Floyd Algorithm[J].Audio Engineering,2011,35(12):65-67. |
| |
| Authors: | ZHU Hao ZHANG Yu |
| |
| Affiliation: | (Electornic Engineering of PLA,Hefei 230037,China) |
| |
| Abstract: | There may be more than one shortest paths between nodes in the networks.First,the array composed by shortest paths of nodes using the accelerated Floyd algorithm is obtained;then the array composed by arrived distance of each node is constructed using this array,to compared with the array composed by shortest paths;last,followed nodes of each node are obtained,and then all the shortest paths are received.The simulation on the computer shows efficiency of the algorithm. |
| |
| Keywords: | network shortest path Floyd algorithm node |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
