Login to filter by course Login to filter by course Reset
Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.
Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.
Introduces Union-Find data structure and Prim's algorithm for minimum spanning trees in graphs, exploring cuts and historical origins.
Explores the equivalence between maximum flow and minimum cut in network theory, demonstrating its applications through examples and edge-disjoint paths.
Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
