>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
In an unweighted graph, which traversal finds a path with the fewest edges? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Medium
In an unweighted graph, which traversal finds a path with the fewest edges?
Graphs
Search algorithms
Choose your answer
A
Depth-first search
B
Selection sort
C
Breadth-first search
D
Binary search
Check answer
More in Algorithms →