Which of the following shortest-path algorithms can handle graphs that contain negative edge weights (but no negative cycles)?

Explanation

Bellman–Ford relaxes every edge V − 1 times and works with negative weights, whereas Dijkstra's algorithm assumes non-negative weights.