| Floyd算法分析与演示系统设计 |
| |
| 引用本文： | 潘丹,甘宏.Floyd算法分析与演示系统设计[J].适用技术之窗,2008(5):176-178. |
| |
| 作者姓名： | 潘丹 甘宏 |
| |
| 作者单位： | 广州城建职业学院,广州从化510925 |
| |
| 摘 要： | 路径分析是网络分析最基本的问题，其核心是对最短路径的求解，其求解算法的优劣决定相关软件的性能，通过对Floyd算法分析，比较了各种算法的时间复杂度，并使用Java语言设计演示程序说明了Floyd算法的实现机制。
|
| 关 键 词： | 最短路径 Floyd算法 复杂度 演示系统 |
Analysis of Floyd Algorithm And Design of Desigh of Demonstration System |
| |
| Pan Dan Gan Hong.Analysis of Floyd Algorithm And Design of Desigh of Demonstration System[J].Science & Technology Plaza,2008(5):176-178. |
| |
| Authors: | Pan Dan Gan Hong |
| |
| Affiliation: | Pan Dan Gan Hong (Guangzhou City Construction College, Guangzhou Conghua 510925) |
| |
| Abstract: | Path analysis is the most basic problem in network analysis, its central problem is how to solve the shortest path between two point, moreover, its algorithm will affect the performance of associated Software. in this paper, first of all, Floyd algorithm is analyzed in detail. Secondly, I compare timeComplexity ofthree algorithm, Finally, Demo program proves Floyd algorithm byJAVA language. |
| |
| Keywords: | Shortest Path Floyd Algorithm Complexity Demonstration System |
| 本文献已被 维普 等数据库收录！ |
|
