Sign inSign in

Tree edge

Tree edges are edges that lead to an unvisited vertex during a depth-first search, forming a directed tree or forest.
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.

Depth-first search2Graph traversal2

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Victor Costan

    MIT · Undergraduate

    Edges that are part of the DFS tree, representing the order in which DFS visited the nodes.
    • 23:10Depth-First Search (DFS) (MIT 6.006, Recitation 14)

Connections

7

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

Concepts5

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.