Subject: Re: [boost] [BGL] StoerâWagner min-cut algorithm
From: Daniel Trebbien (dtrebbien_at_[hidden])
Date: 2010-07-05 14:59:06
> What I really need to is to find source set of a min-cut between s(source)
> and t(target) in a directed graph, and hence a maximum closure of the graph.
> So, I need to find a s-t min-cut, not just any min-cut. Can Stoer-Wager's
> min-cut be forced to find s-t min-cut only (and thus has reduced time
> complexity)? If not then, I guess I'll have to stick with a max-flow
I would stick with a max-flow algorithm. I am not aware of a way to
force the StoerâWagner min-cut algorithm to find a minimum s-t cut for
a given s and t.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk