Lecture 19: Shortest Paths, Bellman-Ford, Negative cycles
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.
To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video