Minimum Spanning Trees - Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne

4.3 Minimum Spanning Trees Minimum spanning tree. An edge-weighted graph is a graph where we associate weights or costs with each edge. A minimum spanning tree (MST) of an edge-weighted graph is a spanning tree whose weight (the sum of the weights of its

algs4.cs.princeton.edu