13. Dijkstra
43,310 views
About this video
Hand-picked by a BrighterTube curator · found via Developer-Y/cs-video-coursesTeaches Dijkstra's algorithm, why it needs non-negative weights, and its running time with different priority queues. Taught by Erik Demaine, Jason Ku and Justin Solomon from MIT's current 6.006 syllabus, with board work that is easy to follow on video.
MIT 6.006, lecture 13: Dijkstra's algorithm, why it needs non-negative weights, and its running time with different priority queues.
Video by MIT OpenCourseWare, played through YouTube's embedded player.
Part of MIT 6.006 Introduction to Algorithms, Spring 2020
Go deeper
As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.