最小耗费生成树（Minimum cost spanning tree）.docVIP

最小耗费生成树（Minimum cost spanning tree） Make f the edge of the loop that is not in the T. Since the loop is not included in the T, at least one edge of the loop formed is not in the T. From the selection method of E and F can be seen in the V=U+ {e} double f} is a spanning tree, and T k- has exactly 1 edges do not appear in V. Now to prove that V costs as much as U does. Obviously, the cost of V is equal to the cost of U, plus the cost of the upper e, and then subtract the cost of the edge F. If the cost of E is smaller than f, then the cost of spanning tree V is less than that of U, which is impossible. If the cost of E is higher than f, in the K r u s k a l algorithm, f will be considered before E. Since f is not in T, the Kruskal algorithm discards F when considering whether f can join T, so f and T consume less than or equal to f to form a loop. By selecting e, all of these edges are in U, so U must contain loops, but in reality this is impossible because U is a spanning tree. The price of E is higher than fs hypothesis, which will lead to contradiction. The only remaining possibility is that E has the same cost as F, which shows that V and U consume the same amount. (3) data structure selection and complexity analysis In order to select edges in a non decreasing order, a minimum heap can be built and each side is removed from the pile as needed. When there is a e edge in the graph, it takes time (E) to initialize the heap and O (l o GE) to select each edge. The set T of the edge, together with the vertices in the G, defines a graph composed of at most N connected subgraphs. Vertex sets are used to describe each subgraph, and these vertex sets have no common vertex. To determine whether the edges (U, V) generate loops, simply check whether the U V is centered on the same vertex (that is, in the same subgraph). If so, a loop will be formed; if not, the loop will not be generated. Thus, two F i n d operations are sufficient for the vertex set. When an edge is containe