Boost Users :
From: Trevon Fuller (tfuller_at_[hidden])
Date: 2003-09-14 12:17:31
Does anyone know how to find all of the minimum size cut sets of a graph (if
more than 1 exists) using the BOOST graph library? The example in the BGL
book just finds 1 minimum cut set (p. 106ff.).
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