Floyd算法求解最短路径的简明方法  

The Simple Way to Determine the Shortest Path with Floyd Algorithm

作　　者：曾方俊[1] 

机构地区：[1]贵州商业高等专科学校,贵阳550004

出　　处：《价值工程》2012年第19期167-168,共2页Value Engineering

摘　　要：最短路问题属于求优问题的一种,Floyd算法能够很方便地求出某网络上任意两点间的最短路长,但要去确定两点间具体的最短路径,算法本身的表述就显得比较含糊,相关文献对此问题有过相应的探讨,文章紧密联系Floyd算法思想,在算法的基础上揭示了最短路径确定的简洁方式。The shortest path problem belongs to a kind of acquiring optimal solution, and Floyd algorithm can easily find the shortest path between any two points on a network. However, to determine the specific shortest path between two points, expression of algorithm itself appear to be more vague, and related literatures made corresponding discussion on this problem. The paper is closely linked the idea of Floyd algorithm, reveals a simple way to determine the shortest path based on the algorithm.

关 键 词：最短路 算法 路径 

分 类 号：F224.3[经济管理—国民经济]