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.

Filename	Size	Update
prim建立n个城市间的最小生成树.txt	7571	2018-06-20

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．