Given a weighted undirected graph G=(V, E), edge (u, V) ∈ E's weight for w (u, V), is given a point set u? V. to find a spanning tree meet: 1. All U nodes in the collection are the leaves of the trees; 2. The tree is to satisfy conditions 1 rights and minimum spanning tree in the edge, please design a efficient algorithm as far as possible, and satisfy the conditions of legal spanning tree, or judgment, there is no such spanning tree,

CodePudding user response:

Top, DDD