Packing and Covering Paths
Kent Quanrud · 68:13 · Watch on YouTube
The max number of edge-disjoint S-T paths always equals the min number of edges whose removal disconnects S from T, and a greedy search with reverse residual edges finds both optimally.