OurBigBook About$ Donate
 Sign in Sign up

Depth-first search

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Graph algorithms
 1 By others on same topic  0 Discussions Create my own version
Depth-first search (DFS) is an algorithm used for traversing or searching through tree or graph data structures. The algorithm starts at a selected node (often referred to as the "root" in trees) and explores as far as possible along each branch before backtracking. This method allows DFS to explore deep into a structure before returning to explore other nodes.

 Ancestors (6)

  1. Graph algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Depth-first search by Ciro Santilli 37 Updated 2025-07-16
 Read the full article
  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