Applying the UNION-FIND ADT to Constructing Minimum Spanning Trees for Graphs

Given a connected undirected weighted graph G = (V, E), a minimum spanning tree is a subgraph T of G such that:

T is a tree (connected and contains no cycles),

T contains each v in V,

The total weight of all edges in T is as low as possible for all such spanning trees.

Previous slide

Next slide

Back to first slide

View graphic version