depth-first
Plunge before spreading
Depth-first describes a search or traversal strategy that explores as far as possible along each branch before backtracking.
In computing, a depth-first search moves down through a tree or graph structure, fully exploring one path before trying alternatives.
The approach contrasts with breadth-first, which examines all options at each level before going deeper: The algorithm uses depth-first traversal to find the exit.
Act of seeking
- traversalAct of moving through
- recursionProcess invoking itself
- backtrackingReversing to find alternatives
- stackItems piled vertically
graph · tree · exploration · DFS · pathfinding · maze · node · branch
Complete in every detail
- comprehensiveIncluding all elements
- verticalAt right angles groundward
- focusedDirecting attention narrowly
- immersiveFully engaging the senses
intensive · sequential · methodical · systematic · prioritization · single-track · commitment · persistence
search
Act of seeking
- traversalAct of moving through
- recursionProcess invoking itself
- backtrackingReversing to find alternatives
stack · graph · tree · exploration · DFS · pathfinding · maze · node · branch · leaf
thorough
Complete in every detail
- comprehensiveIncluding all elements
- verticalAt right angles groundward
- focusedDirecting attention narrowly
immersive · intensive · sequential · methodical · systematic · prioritization · single-track · commitment · persistence · specialization
depth-firstbreadth-first
Traversal by horizontal layers
breadth-first search · layer-by-layer · Dijkstra's algorithm
depth, first, deep, deepen, deeply, deepness, depths, deeper, deepest