Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Which of the following statements about the Bellman-Ford algorithm is TRUE?
It only works on Directed Acyclic Graphs (DAGs).
It is faster than Dijkstra’s algorithm for all types of graphs.
It cannot handle graphs with negative edge weights.
It detects negative weight cycles reachable from the source node.
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!