Which algorithm solves the single-source shortest-paths problem in the general case in which edge weights may be negative?
A. Dijkstra algorithm
B. Bellman-Ford algorithm
C. Ford-Fulkerson algorithm
D. Prim algorithm
Answer:B
Which algorithm solves the single-source shortest-paths problem in the general case in which edge weights may be negative?
A. Dijkstra algorithm B. Bellman-Ford algorithm C. Ford-Fulkerson algorithm D. Prim algorithm