= Lecture 17: Shortest Paths III: Bellman-Ford
{c}
{title2=Fall 2011 course}
Lecture notes in <6.006 Introduction to Algorithms, Fall 2011 by Massachusetts Institute of Technology, 6.006 course staff>. Massachusetts Institute of Technology issues the notes; MIT OpenCourseWare hosts them. No individual note-author byline is established. Fall 2011 dates the course offering; no separate PDF publication or revision date is verified.
Official notes: https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/5edb13fb34cbe7f4cdccc13d131772e7_MIT6_006F11_lec17.pdf
Inspected locators: printed pp. 1 and 3–5, distance convention, algorithm, proof and reachable-cycle corollary.
Back to article page
