search for: mincut

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.

...method = c("recursive.partitioning"), : maximum depth reached The structure of getting output is given below: iris.tr = tree(Species ~., data=training.data, method=c("recursive.partitioning"), split = c("gini"), control=tree.control(nobs = 150, minsize = 5, mincut = 2)) Any suggestion will be appreciated to handle the above problem. Thanks and best regards Muhammad Azam [[alternative HTML version deleted]]

...example below i used k=0 but i don't know why? But if i use k=NULL, then it will not plot the resultant tree. library(tree) ds=iris; iris=transform(iris, Species = factor(Species, labels = letters[1:3])) miris <- tree(Species ~ ., data = iris, control=tree.control(nobs = 150, minsize = 5, mincut = 2)); iris.prun=prune.tree(miris, method=c("misclass"), best = NULL, k=0); iris.prun; summary(iris.prun); plot(iris.prun) best regards Muhammad Azam [[alternative HTML version deleted]]

...t version) tree (..) Splus 6.0 Solaris 5.7 tree dataset: 100,000 records about 3 variables regression tree data read in from flat file, summary() on R and Splus showed identical distributions tree were run with all the deault setting (no mincut, minsize set etc) with added options: minsize=2, mindev=-1, get the same small tree. Did I miss anything? thanks -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info"...

....intersection.by.name(), graph.union.by.name(), graph.difference.by.name(). Thanks to Magnus Torfason for contributing his code! - Function to calculate a non-induced subraph: subgraph.edges(). - More comprehensive maximum flow and minimum cut calculation, see functions graph.maxflow(), graph.mincut(), stCuts(), stMincuts(). - Check whether a directed graph is a DAG, is.dag(). - has.multiple() to decide whether a graph has multiple edges. - Added a function to calculate a diversity score for the vertices, graph.diversity(). - Graph Laplacian calculation (graph.laplacian()) supports edge we...

....intersection.by.name(), graph.union.by.name(), graph.difference.by.name(). Thanks to Magnus Torfason for contributing his code! - Function to calculate a non-induced subraph: subgraph.edges(). - More comprehensive maximum flow and minimum cut calculation, see functions graph.maxflow(), graph.mincut(), stCuts(), stMincuts(). - Check whether a directed graph is a DAG, is.dag(). - has.multiple() to decide whether a graph has multiple edges. - Added a function to calculate a diversity score for the vertices, graph.diversity(). - Graph Laplacian calculation (graph.laplacian()) supports edge we...