cycle

A path in a graph that starts and ends at the same vertex.

In more detail

A dependency graph with a cycle has no valid order: A needs B, which needs A. Trees and DAGs have no cycles by definition, and Kruskal's algorithm refuses any edge that would close one.

Related terms

Taught in

References