Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.
Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Introduces Union-Find data structure and Prim's algorithm for minimum spanning trees in graphs, exploring cuts and historical origins.
Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.
Covers network flow algorithms, including Max Flow, Min Cut, and Negative Cost Cycle Algorithm, progressing from basic definitions to advanced algorithms like Bellman-Ford and Dijkstra's.
Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
