Lecture 13: Connectivity and Trees

1:22:02 Free

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!)?

Source: Erik Demaine, Mathematics for Computer Science (MIT: OpenCourseWare). Licensed under CC BY-NC-SA 4.0.

Hypha Official

Watch what matters. Create what pays.

see also ↓