[igraph] minimum cut; undirected graph

[gregory benison]

Hello -

I am interested in obtaining the minimum cut of an undirected graph,
like what you can get with igraph_mincut_value(), only obtaining the
actual partition of the graph (i.e. indices of the vertices in the two
sets of the partition) rather than the minimum cut value.  Is there a
way to do that already?  If not, would a modified
igraph_mincut_value() that remembered partitions as it went do the
job?

- Greg

--

======================
Gregory Benison
Oregon State University
(541)-737-1876
gbenison at gmail dot com
======================