From: Leandro Melo (ltcmelo_at_[hidden])
Date: 2006-05-03 09:24:51
Hi.
Due to the special requirements of boost maxflow algorithms
(edmonds-karp and preflow-push), I don't know how the procedure would
be for computing maxflow in graph with biderected edges. In other
words, graphs that already have edges (u, v) and (v, u) for a few
given vertices u and v. In such graphs, it would not be possible for
example to set the capacity of reverse edge to 0 (zero). Would the
implementation work anyway?
Also, is there a way to set lower bounds for the flow of some given edges?
Thanks.
-- Leandro Terra C. Melo