Shortest Path Algorithm Identification
A programmer wants to combine breadth-first search with a greedy algorithm to find the shortest path in a weighted graph. What is the resulting algorithm?
A
Kruskal’s algorithm
B
Prim’s algorithm
C
Bellman-Ford algorithm
D
Dijkstra’s algorithm
Question Leaderboard
Not enough data yet to show leaderboard.
APFIVE