**L15 - Shortest Paths II**
http://courses.csail.mit.edu/6.006/spring11/lectures/lec15.pdf

**Bellman‐Ford** Correctness • Theorem:If has no negative‐ weight cycles, then at the end of **Bellman‐** Ford, for all . • Proof: – Without negative‐weight cycles, shortest paths are always simple – Every simple path has vertices, so edges – Claim iterations make – Safety

**DA:** 59 **PA:** 10 **MOZ Rank:** 43