edmondsOptimumBranching

edmondsOptimumBranching

edmondsOptimumBranching description

Keywords
graphs
Usage
edmondsOptimumBranching(g)
Arguments
g
instance of class graphNEL from Bioconductor graph class
Details

This is an implementation of Edmonds' algorithm to find optimum branching in a directed graph. See references for details.

References

See Edmonds' Algorithm on http://edmonds-alg.sourceforge.net.

Aliases
  • edmondsOptimumBranching
Examples
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
Documentation reproduced from package RBGL, version 1.48.1, License: Artistic-2.0

Community examples

Looks like there are no examples yet.