Lecture 19: Shortest Paths, Bellman-Ford, Negative cycles

L19 Slides

We discussed situations that are modelled with graphs with negative edge weights, and then discussed the Bellman-Ford algorithm for finding shortest paths in such graphs.