depth-first search
Depth-first search is a graph traversal algorithm that explores as far as possible along each branch before backtracking. It systematically explores the depth of a graph by prioritizing visiting adjacent nodes rather than searching breadth-wise.
Requires login.
Related Concepts (1)
Similar Concepts
- breadth-first search
- breadth-first search (bfs)
- depth-first search (dfs)
- depth-limited search
- directory traversal
- in-order traversal
- in-order traversal of binary trees
- inorder traversal
- iterative tree traversal
- path traversal
- post-order traversal
- postorder traversal
- recursive tree traversal
- tree recursion
- tree traversal