Depth-first search

In computer science, depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph.

Back to Algorithms →

Source: Wikipedia · Image: Wikimedia Commons · CC BY-SA 3.0

ALGOHAY

Algorithms, demystified — data-structure guides, complexity tools, and interview prep for developers.

Get new guides by emailOccasional emails. No spam. Unsubscribe anytime.

InformationAbout Contact Privacy Policy Terms of Service Disclaimer Affiliate Disclosure Cookie Policy

Every algorithm, image, fact, and figure in the museum is drawn from Wikipedia and Wikimedia Commons, used under public-domain and Creative Commons licenses. No content is AI-generated.