通过定义邻接矩阵，计算节点之间的最短路径长度-By defining the adjacency matrix to calculate the shortest path between node length

最小生成树kruskal原程序——根据数据结构最小生成树的邻接矩阵- Minimum Spanning Tree kruskal of the original program- the data structure of the adjacency matrix of the minimum spanning tree