In the 'igraph' package, there are two (private) functions that can do this. I.e. install and load igraph, and call
igraph:::find.all.min.cutsets() or igraph:::kCutsets() They might be quite slow if your graph is big. Check the source code for some comments. Best, Gabor On Thu, Mar 19, 2009 at 10:58 AM, Benedict Anchang <benedict.anch...@klinik.uni-regensburg.de> wrote: > The minCut function in RBGL package returns only a value or the minimum cut. > I would be > really greatful if any knows of any R function or package available for > finding all minimal cut sets ( i.e., components whose failure will > results in a network failure) between any given pair of vertices. > > ______________________________________________ > R-help@r-project.org mailing list > https://stat.ethz.ch/mailman/listinfo/r-help > PLEASE do read the posting guide http://www.R-project.org/posting-guide.html > and provide commented, minimal, self-contained, reproducible code. > -- Gabor Csardi <gabor.csa...@unil.ch> UNIL DGM ______________________________________________ R-help@r-project.org mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code.
