Ford–Fulkerson, C++, Boost Graph Library
Jump to navigation
Jump to search
Primary author of this description: I.V.Afanasyev.
Contents
1 Links
Boost Graph Library (function edmonds_karp_max_flow): Edmonds–Karp algorithm, complexity [math]O(nm^2)[/math] for real weights and [math]O(Kmn)[/math] for integers not exceeding [math]K[/math].
