POJ 3522 Slim Span（最小差值生成树）

Slim Span

Description

Given an undirected weighted graph G, you should find one of spanning trees specified as follows.

The graph G is an ordered pair (V, E), where V is a set of vertices { v₁, v₂, …, v_n} and E is a set of undirected edges { e₁, e₂, …, e_m}. Each edge e ∈ E has its weight w(e).

A spanning tree T is a tree (a connected subgraph without cycles) which connects all the n vertices with n − 1 edges. The slimness of a spanning tree T is defined as the difference between the largest weight and the smallest weight among the n − 1 edges of T.

Figure 5: A graph  G and the weights of the edges

For example, a graph G in Figure 5(a) has four vertices { v₁, v