Re: [boost] [BGL] Stoer–Wagner min-cut algorithm

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 algorithm.

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.