Hi Louis, If you only need a single solution, use graph.maxflow to find a maximum flow with equal edge capacities between your two given vertices. The $cut element of the result object will give you the edges to remove. E.g.:
g <- graph.full(5) + graph.full(5) g[1,6] <- 1 graph.maxflow(g, 2, 7)$cut Currently we have no function for enumerating all the possible maximum flows (equivalently, all the minimum edge cut sets) in undirected graphs. Best,-- T. On Monday, 10 September 2012 at 18:25, Louis Aslett wrote: > Hi Gabor, > > Thanks for the igraph R package, I continue to enjoy using it a lot lately! > I've one problem at the moment which involves computing the collection of > minimal edge cut sets between two vertices for an undirected graph. The R > function stMincuts does the same thing for directed graphs. Is there any > means of using igraph to do this in the undirected case? > > All the best, > > Louis > > _______________________________________________ > igraph-help mailing list > [email protected] (mailto:[email protected]) > https://lists.nongnu.org/mailman/listinfo/igraph-help _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
