From: Chris Jefferson (chris_at_[hidden])
Date: 2008-05-17 15:49:49
I'm looking to find the global 'vertex cut' of an undirected graph.
While there are special algorithms for doing this, but I have found it
can be mapped into a set of directed min-cut problems, which can be
mapped into the bgl.
However, it seems that while I can find the value of the max flow, I
cannot find the corresponding minimum cut. Am I missing something very
obvious?
Chris