Minimum Spanning TreesCovers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.
Prim's and Kruskal's AlgorithmsExplores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Minimal Spanning TreeCovers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.
Union-Find and Prim's AlgorithmIntroduces Union-Find data structure and Prim's algorithm for minimum spanning trees in graphs, exploring cuts and historical origins.
