6.006 | Spring 2008 | Undergraduate

Introduction to Algorithms

Lecture Notes

Lecture 16: Shortest Paths II: Bellman-Ford

Description:

Lecture notes on shortest paths, notation, generic S.P. algorithm, Bellman-Ford algorithm, analysis, and correctness.

Resource Type:
Lecture Notes
pdf
1 MB
Lecture 16: Shortest Paths II: Bellman-Ford
Download File

Course Info

Departments
As Taught In
Spring 2008
Level
Undergraduate
Topics
Learning Resource Types
Problem Sets
Exams with Solutions
Lecture Notes
Presentation Assignments with Examples
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2025 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2025 Massachusetts Institute of Technology