Depth-First Search (DFS)
9 min · Scala examples
Dive deep along one path before backtracking — great for exploring all reachable nodes.
Scala · Depth-First Search (DFS)0/5 cleared
Enemy 1 of 5
DFS uses recursion or an explicit stack to go as far as possible, then back up. Mark nodes visited so you don't loop forever.
Counting connected components in a grid is a classic DFS job.
You
Invisible Heisenbug
Loading editor…
Sign up to fightThis one runs on our servers, so it needs a free account.
Stuck? Ask Rena
Your AI tutor that gives assistance.
Asking Rena in lessons is on Ultimate.