Title:
zui_xiao_sheng_cheng_shu
Download
Description: 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.
File list (Check if you may need any files):
