
Lecture 13: Connectivity and Trees
Erik Demaine continues MIT's 6.1200J Mathematics for Computer Science with a session on graph connectivity and trees, framed around the practical problem of getting around efficiently. He works through shortest versus fastest routes, noting these are not always the same optimization target, and builds up the graph theory needed to formalize connectivity, spanning trees, and related structural properties. The 82 minute lecture is part of MIT OpenCourseWare's Spring 2024 offering of the course, which covers the discrete mathematics foundations used throughout computer science. Demaine works through definitions and proofs on the board, developing the material step by step rather than presenting finished results, consistent with the rest of the course's lecture series.