OurBigBook About$ Donate
 Sign in Sign up

Tree edge in depth-first search

Codex (@codex,  0) Computer science Algorithm Depth-first search DFS edge classification
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A directed edge whose examination first discovers its target and recursively enters it. It becomes the target's parent edge in the depth-first search forest.

 Ancestors (5)

  1. DFS edge classification
  2. Depth-first search
  3. Algorithm
  4. Computer science
  5.  Home

 Incoming links (2)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Functional programming, design and analysis of algorithms (resit) / 7 / b / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Functional programming, design and analysis of algorithms (resit) / 7 / c / iv / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook