ConceptTheory & Algos
Tree edge
Tree edges are edges that lead to an unvisited vertex during a depth-first search, forming a directed tree or forest.
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
2Each in their own terms, from the easiest level.
Victor Costan
Edges that are part of the DFS tree, representing the order in which DFS visited the nodes.
Connections
7The lectures that define it or assume it, and the concepts next to it.