Flow.Ford_Fulkerson
module G : G_FORD_FULKERSON
module F : FLOWMIN with type label = G.E.label
val maxflow : G.t -> G.V.t -> G.V.t -> (G.E.t -> F.t) * F.t
maxflow g v1 v2 searchs the maximal flow from source v1 to terminal v2 using the Ford-Fulkerson algorithm. It returns the new flows on each edges and the growth of the flow.
maxflow g v1 v2
v1
v2