ConceptTheory & Algos
Cycle cover
A collection of vertex-disjoint directed cycles that covers every vertex in a directed graph exactly once.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
9The lectures that define it or assume it, and the concepts next to it.