Introduction - If you have any usage issues, please Google them yourself
Problem Description: given the distance network between n cities in a region, the minimum spanning tree is established by prim algorithm or Kruskal algorithm, and the cost of the minimum spanning tree is calculated.
Basic requirements:
1. The distance network between cities is represented by adjacency matrix, and the definition of adjacency matrix storage structure is given in the textbook. If there is no road between two cities, the weight of the corresponding edge is set to its own infinite value. It is required to display the roads between cities in the minimum spanning tree and the cost of the minimum spanning tree.
2. Adjacency matrix representing distance network between cities (at least 6 cities and 10 edges are required)
3. The minimum spanning tree includes the edges and their weights, and shows the cost of the minimum spanning tree.