Question

Which shortest-path algorithm is appropriate for graphs with non-negative weights and supports decrease-key efficiently for faster performance?

A Bellman-Ford
B Dijkstra’s algorithm with binary heap
C Dijkstra’s algorithm with Fibonacci heap
D BFS
E Kruskal’s algorithm
Practice Next

Hey! Ask a query