Minimum Spanning Trees (Kruskal's + Prim's Algorithms) - Graph Algorithms - Algorithms Part 8
In this lecture, we transition from greedy algorithms to graph algorithms by discussing minimum spanning trees. In particular, we explain how to compute the MST for a given graph using Kruskal's and Prim's Algorithms.
Timestamps:
00:00 Introduction
00:36 Graph Theory
02:58 Minimum Spanning Trees
4:11 Kruskal's Algorithm
7:52 Prim's Algorithm
9:36 Conclusion
#spanningtree #graphtheory #kruskal #prim #greedyalgorithms #algorithms #timecomplexity #computerscience