Artificial Intelligence · Level 2 of 5
Depth-First Search
A search that follows one branch deeply before backtracking.
It uses a stack or recursion and need not find the shortest route.
Example
A program explores one directory subtree before its siblings.
Listen to the definition and example
Audio transcript
Depth-First Search. A search that follows one branch deeply before backtracking. It uses a stack or recursion and need not find the shortest route. For example: A program explores one directory subtree before its siblings.
Explore this concept
Why it matters
These distinctions help you separate a system’s task, representation, and reasoning method.
Related concepts
Quick recall question
Try answering before looking back at the definition.