| 稀疏网络的Floyd动态优化算法 |
| |
| 引用本文： | 吴果林,金珍,邓小方. 稀疏网络的Floyd动态优化算法[J]. 江西师范大学学报(自然科学版), 2013, 0(1): 28-32 |
| |
| 作者姓名： | 吴果林 金珍 邓小方 |
| |
| 作者单位： | 桂林航天工业学院信息工程系,广西桂林,541004；南昌工程学院理学系,江西南昌,330099；江西师范大学软件学院,江西南昌,330022 |
| |
| 基金项目： | 广西省教育厅科研课题(201106LX717)资助项目 |
| |
| 摘 要： | 通过对Floyd算法进行研究,提出了一种新的求取任意两点间最短路径的算法:Floyd动态优化算法.该算法通过引入插入数组、可达数组以及可发数组,使得算法在求解最短路径前自动修改能够最小化路径的节点,剔除一些无用的节点,最小化语句执行的次数.算法分析表明,新算法在稀疏网络中比Floyd算法在性能上有较大的提高.
|
| 关 键 词： | 最短路径 Floyd算法 插入数组 可达数组 可发数组 |
The Floyd Dynamic Optimization Algorithm of the Sparse Network |
| |
| WU Guo-lin,JIN Zhen,DENG Xiao-fang. The Floyd Dynamic Optimization Algorithm of the Sparse Network[J]. Journal of Jiangxi Normal University (Natural Sciences Edition), 2013, 0(1): 28-32 |
| |
| Authors: | WU Guo-lin JIN Zhen DENG Xiao-fang |
| |
| Affiliation: | 1.Department of Information Engineering,Guilin University of Aerospace Techology,Guilin Guangxi 541004,China; 2.Department of Science,Nanchang Institute of Technology,Nanchang Jiangxi 330099,China; 3.Software School,Jiangxi Normal University,Nanchang Jiangxi 330022,China) |
| |
| Abstract: | By searching for Floyd algorithm,a new method between any two nodes of the shortest path algorithm is proposed,which is Floyd dynamic optimization algorithm.By introducing insert array,reachable array and starting-off array,the algorithm changes automatically path nodes,eliminates some useless nodes and minimizes the number of execution statements before solving the shortest path.The algorithm analysis shows that the new algorithm has more performance than Floyd algorithm in sparse network. |
| |
| Keywords: | shortest path Floyd algorithm insert array reachable array starting-off array |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《江西师范大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《江西师范大学学报(自然科学版)》下载全文 |
|
