Floyd算法的演示模型研究  

Research of Floyd Algorithm Demonstration Model

作　　者：叶奇明[1] 石世光[2] 

机构地区：[1]茂名学院理学院,广东茂名525000 [2]电子科技大学中山学院,广东中山528403

出　　处：《海南大学学报（自然科学版）》2008年第1期47-50,共4页Natural Science Journal of Hainan University

摘　　要：路径分析是网络分析最基本的问题,其核心是对最短路径的求解.最短路径算法的优化直接关系到网络分析技术的提高,其求解算法的优劣决定相关软件的性能,通过对Floyd算法基本思想?算法实现步骤和时间复杂度分析,比较了各种算法的时间复杂度,并使用Java语言设计演示程序说明Floyd算法的实现机制,为Floyd算法的掌握和优化提供了参考模型.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.

关 键 词：最短路径 FLOYD算法 复杂度 演示系统 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]