Flow network
Learn feasible flows, residual forward and reverse arcs, augmenting paths, cut bounds, and when Ford–Fulkerson terminates.
Category
Graph theory
3 articles.
2022-04-12
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.