Groups
Category
Depth-First Search (DFS) explores a graph by going as deep as possible along each path before backtracking.
Complete search enumerates every candidate solution, while backtracking prunes branches that cannot possibly lead to a valid or better solution.