Catalog · Design and Analysis of Algorithms Lecture 12 of 34 Lecture 12: Greedy Algorithms: Minimum Spanning Tree ← Previous Lecture 11: Dynamic Programming: All-Pairs Shortest Paths Next → Lecture 13: Incremental Improvement: Max Flow, Min Cut ✓ Mark complete Materials Transcript (PDF) ↗ transcript