论文部分内容阅读
The minimum spanning tree problemis to find a tree that connects all the vertices in a graph with the minimum total weight.It is one of the mosttypical problems in combinatorial optimization and has many applications in communicationnetwork, statistical cluster analysis, image processing, etc.For instance, in networkrouting protocols, the minimum cost spanning tree is one of the most effectivemethods to broadcast the messages from a source node to a set of destinations.