Home /
Expert Answers /
Computer Science /
negative-cycles-the-bellman-ford-algorithm-if-the-length-of-the-edge-e-b-were-changed-to-4-th-pa931
(Solved): Negative cycles: The Bellman-Ford algorithm - If the length of the edge (E,B) were changed to -4, th ...
Negative cycles: The Bellman-Ford algorithm -
If the length of the edge (E,B) were changed to -4, the graph would have a negative cycle A ? E ? B ? A. There is a path of length 2 from A to E. But going round the cycle, there's also a path of length 1, and going round multiple times, we find the paths of lengths 0,-1,-2 show how that was obtained
.
Expert Answer
The graph has a negative cycle A ? E ? B ? A. Now, let's find the paths of lengths 0, -1, and -2 by ...