Deck · IOI — Competitive Programming
Advanced Graph Algorithms, Flows & Matching
Deep network flow (Dinic, blocking flows, scaling, unit-capacity bounds), min-cost max-flow (SPFA and Johnson potentials + Dijkstra), max-flow min-cut theorem and applications (König vertex cover, maximum independent set, project selection / maximum closure, Menger edge/vertex-disjoint paths), bipartite matching (König, Hall, Hopcroft-Karp), general matching (Edmonds' blossom), global min cut (Stoer-Wagner), Gomory-Hu tree, 2-SAT, SCC condensation, bridges/articulation/biconnected components, Eulerian paths (Hierholzer) and Chinese postman, DAG path cover and longest path, tree isomorphism hashing, dominator tree, LCA (Tarjan offline, Euler + sparse table), and small-to-large merging.
63 cards · audited · SM-2 spaced repetition
Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.
Sample cards
What is a residual network in a flow problem?
What is an augmenting path and the Ford-Fulkerson principle?
Why can plain Ford-Fulkerson be slow or non-terminating?
What is Edmonds-Karp and its complexity?
What is a blocking flow and a level graph (in Dinic's algorithm)?
Showing 5 of 63 cards. Unlock the program to study them all.
More in IOI — Competitive Programming
Master advanced graph algorithms, flows & matching — and the rest of IOI — Competitive Programming.
One program. 964 audited cards across 14 decks.