>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which graph traversal explores all reachable vertices at one distance before moving to the next distance? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Medium
Which graph traversal explores all reachable vertices at one distance before moving to the next distance?
Traversals
Trees and graphs
Choose your answer
A
Preorder traversal
B
Inorder traversal
C
Depth-first traversal
D
Breadth-first traversal
Check answer
More in Algorithms →