Question

Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?

A Dijkstra
B Bellman-Ford
C Floyd-Warshall
D Prim
E Kruskal
Practice Next

Hey! Ask a query