摘要
路径分析是网络分析最基本的问题,其核心是对最短路径的求解,其求解算法的优劣决定相关软件的性能,通过对F1oyd算法分析,比较了各种算法的时间复杂度,并使用Java语言设计演示程序说明了Floyd算法的实现机制。
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.
出处
《科技广场》
2008年第5期176-178,共3页
Science Mosaic
