module Flow:sig
..end
Algorithms on flows
The following flow algorithms only apply to networks, that are directed graphs together with a source (a 0 in-degree vertex) and a terminal (a 0 out-degree vertex).
module type FLOW =sig
..end
Signature for edges' flow.
module type G_GOLDBERG_TARJAN =sig
..end
Minimal graph signature for Goldberg-Tarjan.
module Goldberg_Tarjan:
module type G_FORD_FULKERSON =sig
..end
Minimal digraph signature for Ford-Fulkerson.
module type FLOWMIN =sig
..end
module Ford_Fulkerson: