Sign inSign in

Cross edge

An edge that goes between two nodes in the DFS tree where neither is an ancestor of the other.
Watch it explained

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

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    An edge that connects two nodes that are not ancestor-related in the depth-first search tree.
    • 22:07Depth-First Search (DFS), Topological Sort

Connections

4

The lectures that define it or assume it, and the concepts next to it.

Concepts2

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.