采用prim算法和kruskal算法求最小生成树
采用dijkstra算法求从顶点到其他顶点的最短路径和最短路径长度。(Using prim algorithm and Kruskal algorithm to find minimum spanning tree　　　　　　Dijkstra algorithm is used to find the shortest path and the shortest path length from vertex to other vertices.)