MIT 6.006 Introduction to Algorithms, Spring 2020
Instructor: Jason Ku
View the complete course: [ Ссылка ]
YouTube Playlist: [ Ссылка ]
*NOTE: Problem Session 6 is unavailable.*
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.
License: Creative Commons BY-NC-SA
More information at [ Ссылка ]
More courses at [ Ссылка ]
Support OCW at [ Ссылка ]
We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at [ Ссылка ].
