Lecture 17: Bellman-Ford

Published: Dec. 7, 2012, 7:49 p.m.

This lecture reviews shortest path notation, considers a generic shortest path algorithm, and then describes and proves the Bellman-Ford algorithm, which can handle graphs with negative cycles.