[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] Find the vertex cut from vertex_connectivity

**From**: |
Tamas Nepusz |

**Subject**: |
Re: [igraph] Find the vertex cut from vertex_connectivity |

**Date**: |
Fri, 16 May 2008 19:19:43 +0200 |

Hi Chris,

`Are you using igraph from R, C or Python? The R interface has a
``function called graph.mincut, which returns the edges of a minimal cut
``in G. Since determining vertex connectivity involves finding a maximum
``flow in a slightly modified graph, I assume you can try to build the
``modified graph based on the original one and run graph.mincut as
``follows:
`
graph.mincut(graph, value.only=FALSE, capacity=rep(1, vcount(graph)))

`Unfortunately this feature is not yet available in the Python
``interface (but if you are using igraph from Python and willing to
``recompile it, I can send you a patch).
`
If you are using igraph directly from C, try using igraph_mincut:
http://cneurocvs.rmki.kfki.hu/igraph/doc/html/igraph_mincut.html
--
Tamas
On 2008.05.16., at 17:36, Chris Jefferson wrote:

Is there a simple way I can get at least one vertex cut, which
demonstrates the vertex_connectivity? I am currently trying to trace
through the code and algorithms, wondering if this can be easily
extracted from the underlying max flow, but it is not obvious to me
how to do this.
Thank you,
Chris
_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help