FIG provided G (V, E).
w (u, v) represents the right edge (u, v) of.
Minimal spanning tree is connected subgraph of G, it contains n points and the original n-1 edges, and is connected.
If the presence of trees T, and W is such that the right side (T) minimum, and T is a minimum spanning tree.
