← GlossaryWas this page helpful?
What does "depth-first search" mean in programming?
depth-first search is one of the most common terms in software development. This guide explains what it means, how it is used in practice, and why it matters, with real examples from the developer world.
Definition
A graph traversal algorithm that explores as far as possible along a branch before backtracking. Can be implemented recursively or with an explicit stack. DFS is used for topological sorting, cycle detection, and maze solving.
Example
"DFS on a file system visits every file in a directory before moving to the next sibling directory."
Can you put this sentence in the right order?
Tap the words to place them here
Keep building your technical English
You just looked up what this word means. Lingua-e turns vocabulary like this into full practice: fill-in-the-blanks, listening, and real developer conversations.
Practice this for free