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