Graph Theory37 sections · 1633 units
Open in Course

Quiz: Negative Cycles

Knowledge check

Check Your Understanding

Bellman-Ford detects a negative cycle. Does this mean shortest paths don't exist for ALL nodes?

  1. A.Yes, no shortest paths exist anywhere
  2. B.No, only nodes reachable from the cycle are affected
  3. C.No, only nodes where the source can reach a negative cycle that can reach the target
  4. D.No, only nodes that can reach the cycle are affected
Start the roadmap to answer the quizzes and solve the challenges