Shortest Path Algorithm Identification
Which algorithm finds the shortest path in a weighted graph by employing a greedy strategy that explores nodes in a manner similar to a breadth-first search?
A
Kruskal’s algorithm
B
Bellman-Ford algorithm
C
Prim’s algorithm
D
Dijkstra’s algorithm
Question Leaderboard
Not enough data yet to show leaderboard.