11. Weighted Shortest Paths
40,735 views
Why it's on BrighterTube
Hand-picked by a BrighterTube curator · found via Developer-Y/cs-video-courses · 92% confidenceTeaches weighted shortest paths, the relaxation framework and DAG shortest paths. 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.
What you'll learn
MIT 6.006, lecture 11: Weighted shortest paths, the relaxation framework and DAG shortest paths.
Video by MIT OpenCourseWare, played through YouTube's embedded player.