CRAN

optrees 1.0

Optimal Trees in Weighted Graphs

Released Sep 2, 2014 by Manuel Fontenla

Dependencies

igraph 1.2.2

Finds optimal trees in weighted graphs. In particular, this package provides solving tools for minimum cost spanning tree problems, minimum cost arborescence problems, shortest path tree problems and minimum cut tree problem.

Installation

Maven

This package can be included as a dependency from a Java or Scala project by including the following your project's pom.xml file. Read more about embedding Renjin in JVM-based projects.

<dependencies>
  <dependency>
    <groupId>org.renjin.cran</groupId>
    <artifactId>optrees</artifactId>
    <version>1.0-b38</version>
  </dependency>
</dependencies>
<repositories>
  <repository>
    <id>bedatadriven</id>
    <name>bedatadriven public repo</name>
    <url>https://nexus.bedatadriven.com/content/groups/public/</url>
  </repository>
</repositories>

View build log

Renjin CLI

If you're using Renjin from the command line, you load this library by invoking:

library('org.renjin.cran:optrees')

Test Results

This package was last tested against Renjin 0.9.2687 on Aug 25, 2018.

• checkGraph-examples
• findMinCut-examples
• getComponents-examples
• getMinimumArborescence-examples
• getMinimumCutTree-examples
• getMinimumSpanningTree-examples
• getShortestPathTree-examples
• maxFlowFordFulkerson-examples
• repGraph-examples

Source

View GitHub Mirror

Release History

• 1.0