Minimum spanning tree A. Problem description The algorithm of minimum spanning tree is realized by using Prim algorithm or Kruskal algorithm 2. The experiment purpose 1. Grasp the basic concept of the net and the storage structure of the network 2. The algorithm of minimum spanning tree is realized 3. The experimental requirements 1. To determine the adjacent vertex and power plant of the edge, establish a connectionless network, and realize the minimum spanning tree. 2. Prim algorithm thought: Set G= (V, E) is an undirected graph, and T= (U, TE) is the minimum spanning tree of G. The initial status to U of T = {where v0}, TE = {}, then repeat the following operations: in all of U, v, find a minimum cost of side edge (U, v) into the collection of TE, incorporated into the U and v, until U = v. So you have n minus 1 edges in TE, and T is the minimum spanning tree.

Packet : 31767669zui_xiao_sheng_cheng_shu.rar filelist
zui_xiao_sheng_cheng_shu.txt

• 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．