Practice
Learn
← Quit
0 / 0 correct
Algorithms
Easy
1 of 10
Which algorithm finds the shortest path (fewest edges) in an unweighted graph?
A
Breadth-first search
B
Dijkstra with a max-heap
C
Depth-first search
D
Topological sort