利用邻接矩阵构造图，并求出某一顶点到其余顶点的最短路径并打印输出。-Using the adjacency matrix structure maps, and find the rest of the vertices of a vertex to the shortest path and print output.