Boost logo

Boost Users :

Subject: [Boost-users] Min cut between two vertices, undirected graph
From: Mads Jensen (mje_at_[hidden])
Date: 2015-02-12 05:24:38


The Stoer Wagner implementation only takes as input a complete graph,
and then it computes the min cut with the parity map indicating which
cut set the vertex belongs to. I need something for computing the
minimum cut between two arbitrary vertices given as input for an
undirected graph. Edmonds Karps works just for a directed graph.

Any help with this will be highly appreciated.

Med Venlig Hilsen / Kind regards,
Mads Jensen
Max Jerry Horovitz: "Unfortunately, in America, babies are not found in
cola cans. I asked my mother when I was four and she said they came from
eggs laid by rabbis. If you aren't Jewish, they're laid by Catholic
nuns. If you're an atheist, they're laid by dirty, lonely prostitutes."
         -- Mary and Max (2009)

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at