LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Lecture 13: Connectivity and Trees
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Lecture 13: Connectivity and Trees

82 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 13

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.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 22 m
Compared with MathematicsLonger than 87%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 11 of 2213 h 23 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN
Relations and Counting

Relations and Counting

MIT · 79 MIN