To find the spanning tree of a graph, remove edges until only the minimum number of edges needed to connect all nodes remains.
It has V-1 edges and no cycles.
The weight of a spanning tree is the sum of the edge weights.
A minimum/maximum spanning tree is a spanning tree whose weight is as small/large as possible.
Algorithms: