Category
Level
Depth-First Search (DFS) explores a graph by going as deep as possible along each path before backtracking.