Description: Algorithm characteristics: the algorithm is characterized by the formation of the current set of T is always a tree. The T, U and TE were seen as red dots and red edge set, VU as a blue dot set. Every step of the algorithm are connecting the red, blue, choose a set of purple fringing to expand into the T in the light side. The nature side of MST to ensure that this is safe. T starting from any root r, and gradually grow up to U = V, ie T contains all the vertices of C so far. MST to ensure that this time the nature of the tree T is a G MST. Because each side is to add the right tree as small as possible, so this is a " greedy" strategy.
To Search:
File list (Check if you may need any files):
用普里姆(Prim)算法构造最小生成树.cpp
Download