图的遍历，深度优先，广度优先算法，并带有邻接矩阵-Graph traversal, depth-first, breadth-first algorithm, with adjacency matrix

用 Floyd 算法求任意两点间的最短路径及最短路长. D0 是图的邻接矩阵-Floyd algorithm used for any shortest path between two points and the most long-short-circuit. D0 is the graph adjacency matrix

最短路径算法，在数据结构中图的应用中有很重要的意义，是一个十分重要的算法-The shortest path Algorithm