Max-flow and Disjoint SetsExplores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.
Complexity of AlgorithmsExplores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.
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.
