edmondsOptimumBranching {RBGL} | R Documentation

## edmondsOptimumBranching

### Description

edmondsOptimumBranching description

### 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.

### Value

A list with three elements: edgeList, weights, and nodes for the optimum branching traversal

### Author(s)

Li Long <li.long@isb-sib.ch>

### References

See Edmonds' Algorithm on https://github.com/atofigh/edmonds-alg

### 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

[Package RBGL version 1.63.1 Index]