If a graph has negative weights, which algorithm is suitable for finding the shortest path?
a) Simplex
b) Bellman-Ford
c) Prim’s
d) Dijkstra's
Welcome!
This community is for professionals and enthusiasts of our products and services.
Share and discuss the best content and new marketing ideas, build your professional profile and become a better marketer together.
This question has been flagged
112
Views
