Algorithms · topic
Cut and cycle properties, Kruskal with union-find, Prim with a priority queue, uniqueness conditions, effect of changing weights, counting spanning trees and how an MST differs from a shortest-path tree.
A spanning tree of a connected undirected graph G=(V,E) is a subset of E that connects all vertices and forms a tree (|V|-1 edges, no cycle). A minimum spanning tree (MST) is a spanning tree of minimum total edge weight.
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.
