6.006 | Spring 2020 | Undergraduate

Introduction to Algorithms

Lecture Videos

Lecture 12: Bellman-Ford

This lecture introduces a single source shortest path algorithm that works for general graphs. The process, correctness, and running time of the Bellman-Ford algorithm is discussed.

Instructor: Jason Ku

Course Info

Learning Resource Types
Lecture Videos
Problem Sets with Solutions
Exams with Solutions
Lecture Notes