This a problem in graph theory, a minimum spanning tree construction algorithm. Primm constructed by the minimum spanning tree algorithm process as follows: in all, " has landed one of its vertex spanning tree, while yet another vertex spanning tree falls on the" take a side in the right side is the smallest, one by one added to the spanning tree, until the spanning tree contains n-1 edges so far.

普里姆算法\Debug\graph2.obj
..........\.....\vc60.idb
..........\.....\vc60.pdb
..........\.....\普里姆算法.exe
..........\.....\普里姆算法.ilk
..........\.....\普里姆算法.pch
..........\.....\普里姆算法.pdb
..........\Debug
..........\graph2.cpp
..........\graph2.h
..........\普里姆算法.dsp
..........\普里姆算法.dsw
..........\普里姆算法.ncb
..........\普里姆算法.opt
..........\普里姆算法.plg
普里姆算法

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