1, procedures achieved by the function : 2, the right to establish a good map ca...

1、 程序所实现的功能： 2、 对建立好的无权图，可以找到从某个顶点出发到其他所有顶点的最短路径 3、 程序的输入 4、 要创建的图的信息，本算法采用邻接矩阵表示图；以及遍历开始的顶点的信息 5、 程序的输出 6、 分行输出从给定点到其他各个定点的最短路径上的顶点信息。-1, procedures achieved by the function : 2, the right to establish a good map can be found starting from a certain point to all other nodes in the shortest path three, four input procedures, the setting up of the map information, the algorithm uses adjacency matrix diagram; Traversing the start of the peak information 5, 6 program output, the output from the branches to each other sentinel to the shortest path sentinel on the vertex information.