The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree is a minimum spanning tree. The minimum spanning tree can be found in polynomial time. Common algorithms include those due to Prim and Kruskal's algorithm. The problem can also be formulated using matroids. A minimum spanning tree can be found in the Wolfram Language using the command FindSpanningTree[g]. The Season 1 episodes "Vector" and "Man Hunt" and Season 2 episode "Rampage" of the television crime drama NUMB3RS feature minimal spanning trees.

Kruskal's algorithm | maximum spanning tree | spanning tree

FindSpanningTree