Concepts2
⚙️AlgorithmIntermediate
Depth-First Search (DFS)
Depth-First Search (DFS) explores a graph by going as deep as possible along each path before backtracking.
#depth-first search#dfs#graph traversal+12
⚙️AlgorithmIntermediate
Complete Search and Backtracking
Complete search enumerates every candidate solution, while backtracking prunes branches that cannot possibly lead to a valid or better solution.
#complete search#backtracking#recursion+12