Name: Lecture 17: Bellman-Ford
Uploaded: 2013-01-14T20:26:39Z
Duration: 48 min 51 s
Description: 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

48:51

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