[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**: |
Chris Jefferson |

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

**Date**: |
Sat, 17 May 2008 14:52:03 +0100 |

2008/5/16 Tamas Nepusz <address@hidden>:
>* 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*
I am using C. However, the 'modified graph' is (and has to be I think)
directed, while igraph_mincut only works for undirected graphs.
--Chris