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 O(nm^2) for real weights and O(Kmn) for integers not exceeding K.