MIT

Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceEngineering

Om kurset

Topics covered: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints Instructors: Prof. Erik Demaine, Prof. Charles Leiserson