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
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
Instructors: | |
Course Number: |
|
Departments: | |
As Taught In: | Fall 2011 |
Level: |
Undergraduate
|