edmondsOptimumBranching {RBGL} | R Documentation |
edmondsOptimumBranching description
edmondsOptimumBranching(g)
g |
instance of class graphNEL from Bioconductor graph class |
This is an implementation of Edmonds' algorithm to find optimum branching in a directed graph. See references for details.
Li Long <li.long@isb-sib.ch>
See Edmonds' Algorithm on http://edmonds-alg.sourceforge.net.
V <- LETTERS[1:4] g <- new("graphNEL", nodes=V, edgemode="directed") g <- addEdge(V[1+0],V[1+1],g, 3) g <- addEdge(V[1+0],V[2+1],g, 1.5) g <- addEdge(V[1+0],V[3+1],g, 1.8) g <- addEdge(V[1+1],V[2+1],g, 4.3) g <- addEdge(V[1+2],V[3+1],g, 2.2) x11 <- edmondsOptimumBranching(g) x11