Grasp the characteristics of Prim algorithm, learning algorithm constructed by Prim minimum spanning tree if the undirected connected graph is a network, then it must be all the spanning tree in the side of a tree weight value sum for the smallest, spanning tree, we called for minimum spanning tree. In the Prim algorithm, in Figure G = (V, E) (V said vertex, E said that edges) in one point V0, the collection U = (V0) for the initial state, starting from V0 to find the adjacent vertex of U (another vertex in V in) and the cost of the other side of the smallest vertex V1, and V1 to join U, namely U = (V0, V1), at the same time (V0, V1) to include in the collection side of T in (T of the initial state is empty), this continues to expand U, until U = V, then T is the minimum spanning tree in the side.

二分法
......\prim.cpp

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