说明：  Floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，与Dijkstra算法类似。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。
(Floyd algorithm, also known as interpolation method, is an algorithm that uses the idea of dynamic programming to find the shortest path between multiple sources in a given weighted graph, similar to Dijkstra algorithm. The algorithm is named after Robert Freud, one of the founders, a 1978 Turing Award winner and professor of computer science at Stanford University.)