Unit 6 Class 27: Prim's and Kruskal's Algorithms
Channel: SI335 SI335
Date: 2021-04-01

We study and analyze two effective greedy algorithms for finding the Minimum Spanning Tree (MST) of a graph.