Graph traversal (DFS)
Computer Science · Algorithms
Loading practice question…
About this practice set
Graph traversal (DFS) is part of Computer Science (Algorithms). Questions are generated with new numbers each time you practise. Levels available: Easy. After you answer, an explanation is shown.
Example questions
A taste of what you will practise. Answers are revealed after you try.
Easy
DFS explores a graph:
- As deep as possible first
- Level by level
- Randomly
- Not at all