Graph Theory37 sections · 1633 units
Open in Course

Quiz: Negative Cycle Reachability

Knowledge check

Check Your Understanding

Your graph has a negative cycle, but the destination node is not reachable from that cycle. What does Bellman-Ford report for the destination?

  1. A.Negative infinity
  2. B.An arbitrarily large negative number
  3. C.The correct shortest path distance
  4. D.The algorithm crashes and produces no output
Start the roadmap to answer the quizzes and solve the challenges