module Flow:sig
..end
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
module type G_GOLDBERG =sig
..end
module Goldberg:
module type G_FORD_FULKERSON =sig
..end
module Ford_Fulkerson: