BOJ 1199 — Euler Circuit
Archived technical note: BOJ 1199 — Euler Circuit.
Tag
Graph theory
5 articles.
2022-04-26
Flow network
Learn feasible flows, residual forward and reverse arcs, augmenting paths, cut bounds, and when Ford–Fulkerson terminates.
Floyd-Warshall Algorithm
Derive Floyd–Warshall’s all-pairs recurrence, implement it safely in C++, and interpret unreachable pairs and negative cycles.
Max-flow min-cut theorem
A proof of the max-flow min-cut theorem using residual reachability, with a concrete flow-and-cut certificate.
Graph theory. Strongly Connected Components (SCCs)
Understand strongly connected components and Tarjan’s index, low-link, and active-stack invariants, with a worked graph and implementation.