MIT
Lecture 17: Bellman-Ford
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceEngineering
Om kurset
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