| Floyd算法的演示模型研究 |
| |
| 引用本文： | 叶奇明,石世光. Floyd算法的演示模型研究[J]. 海南大学学报(自然科学版), 2008, 26(1): 47-50 |
| |
| 作者姓名： | 叶奇明 石世光 |
| |
| 作者单位： | 1. 茂名学院,理学院,广东,茂名,525000
2. 电子科技大学,中山学院,广东,中山,528403 |
| |
| 摘 要： | 路径分析是网络分析最基本的问题，其核心是对最短路径的求解．最短路径算法的优化直接关系到网络分析技术的提高，其求解算法的优劣决定相关软件的性能，通过对Floyd算法基本思想、算法实现步骤和时间复杂度分析，比较了各种算法的时间复杂度，并使用Java语言设计演示程序说明Floyd算法的实现机制，为Floyd算法的掌握和优化提供了参考模型．
|
| 关 键 词： | 最短路径 Floyd算法 复杂度 演示系统 |
| 文章编号： | 1004-1729(2008)01-0047-04 |
| 修稿时间： | 2007-05-12 |
Research of Floyd Algorithm Demonstration Model |
| |
| YE Qi-ming,SHI Shi-guang. Research of Floyd Algorithm Demonstration Model[J]. Natural Science Journal of Hainan University, 2008, 26(1): 47-50 |
| |
| Authors: | YE Qi-ming SHI Shi-guang |
| |
| Affiliation: | YE Qi-ming, SHI Shi-guang ( 1. Maoming College, Maoming 525000, China; 2. Zhongshan Institute of UESTC,Zhongshan 528403, China) |
| |
| Abstract: | Path analysis is the most basic problem in network analysis, its core problem is how to solve the shortest path between two point. The shortest path algorithm optimization is directly related to network analysis technology and its algorithm will affect the performance of associated software. Basic idea, steps, and time complexity of Floyd algorithm is analyzed in detail and time Complexity of three algorithm was compared, Finally, Floyd algorithm with JAVA language, Floyd algorithm for the master, and optimization of the reference model was illustrated by demo program. |
| |
| Keywords: | Shortest path Floyd algorithm Complexity Demonstration system |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
