The Minimum Spanning Tree
This video presents the same text shown beside it, spoken and on screen. It adds nothing the text does not say.
State
The minimum spanning tree problem asks for the lowest-cost way to connect all of a graph's vertices — a problem where a crafted greedy rule provably finds the optimum.
Show
Wiring a whole town to broadband at least cost is this problem in work clothes.
Watch for
The proof, not the greed, makes it safe.