Lecture 12: Greedy Algorithms: Minimum Spanning Tree (6.046J)6.046J · Lec 14 · Erik Demaine · MITErik DemaineMIT1:22:10