-
-
Courses
Find courses by:
Collections
Cross-Disciplinary Topic Lists
Translated Courses
-
About
-
Donate
-
Featured Sites
Description: 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.
Instructor: Srini Devadas
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.
© 2001–2012
Massachusetts Institute of Technology
Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.
