ConceptTheory & Algos
Cross edge
An edge that goes between two nodes in the DFS tree where neither is an ancestor of the other.
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.
Lecturers
2Each in their own terms, from the easiest level.
Erik Demaine
An edge that connects two nodes that are not ancestor-related in the depth-first search tree.
Connections
4The lectures that define it or assume it, and the concepts next to it.