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