|
Boost Users : |
From: Daniele Carlucci (dax_at_[hidden])
Date: 2004-09-08 01:52:41
Hi,
How can I find the min-cut, or the max-flow in a graph with all the
costs of edges equal one?
Thanks
Daniele
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net