Tree (graph-theoretic)

A connected graph with no cycles. Equivalently, n vertices and n−1 edges. Spanning trees underlie MST algorithms (Prim, Kruskal).