Lecture 13: Connectivity and Trees

MIT 6.1200J Mathematics for Computer Science, Spring 2024
Instructor: Erik Demaine

View the complete course: https://ocw.mit.edu/courses/6-1200j-mathematics-for-computer-science-spring-2024/
YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61VNvICqk2HXJTonnKgAc9d

Motivation: getting around! In this lecture, we look at optimization problems such as: What about efficiency? Shortest route or fastest route (might not be the same!)?

License: Creative Commons BY-NC-SA
More information at https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu
Support OCW at http://ow.ly/a1If50zVRlQ

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 https://ocw.mit.edu/comments.

Post from MIT OpenCourseWare on July 22, 2025

View Original Post