Floyd算法求解最短路长时的路径确定

最短路问题属于求优问题的一种，Floyd算法能够很方便地求出某网络上任意两点间的最短路长，但要去确定两点间具体的最短路径，算法本身的表述就显得比较含糊，相关文献对此问题有过相应的探讨，本文紧密联系Floyd算法思想，在算法的基础上揭示了最短路径确定的简洁方式。

The most short-circuit problem is a problem for gifted, Floyd algorithm can be easily obtained the length on a network between any two points, but it want to determine the shortest path between two points, was relatively vague itself. On this issue, relevant literature has been on the corresponding description, but all are very complicated. This paper closely linked Floyd algorithm, thought on the basis of the algorithm, revealed the simple way about searching the shortest path.