Question: Which of the following statements is true about the Bellman-Ford algorithm?

Options:

1. It can handle negative weight edges
2. It is faster than Dijkstra\'s algorithm for all graphs
3. It only works on directed graphs
4. It cannot detect negative weight cycles

Correct Answer: It can handle negative weight edges

Solution:

The Bellman-Ford algorithm can handle graphs with negative weight edges and can also detect negative weight cycles.