（1）城市间的距离网采用邻接矩阵表示，邻接矩阵的存储结构定义采用课本上的定义，若两个城市之间不存在道路，则将相应边的权值设为自己定义的无穷大值。要求在屏幕上显示得到的最小生成树中包括那些城市间的道路，并显示得到的最小生成树的代价。
（2）表示城市间距离网的邻接矩阵（要求至少6个城市，10条边）
（3）最小生成树中包括的边及其权值，并显示得到的最小生成树的代价。(1) the distance network between cities is expressed by adjacency matrix, and the storage structure of the adjacency matrix is defined by the definition of the textbook. If there is no road between the two cities, the weight value of the corresponding edge is set to the infinite value of its own definition. The minimum spanning tree required to be displayed on the screen includes those intercity roads and shows the cost of the minimum spanning tree.
(2) denote the adjacency matrix of the distance network between cities (requiring at least 6 cities, 10 sides).
(3) the edges and weights of the minimum spanning tree and the cost of the minimum spanning tree.)