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.
Maximizing Candies in a CityExplores maximizing candies in a city, dynamic programming, minimum spanning trees, and stock price prediction strategies.
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.
Network Flows Meets SimplexExplores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.
Subgraphs vs Induced SubgraphsDistinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.
