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
Lecture Videos
Lecture 17: Bellman-Ford
| Instructors: | |
| Course Number: |
|
| Departments: | |
| As Taught In: | Fall 2011 |
| Level: |
Undergraduate
|
Learning Resource Types
theaters
Lecture Videos
theaters
Recitation Videos
assignment_turned_in
Problem Sets with Solutions
grading
Exams with Solutions
assignment_turned_in
Programming Assignments with Examples
notes
Lecture Notes