CRAN

AcrossTic 1.0-3

A Cost-Minimal Regular Spanning Subgraph with TreeClust

Released Aug 13, 2016 by Sam Buttrey

This package can be loaded by Renjin but 2 out 3 tests failed.

Dependencies

treeClust 1.1-7 lpSolve 5.6.13

Construct minimum-cost regular spanning subgraph as part of a non-parametric two-sample test for equality of distribution.

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>AcrossTic</artifactId>
    <version>1.0-3-b21</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:AcrossTic')

Test Results

This package was last tested against Renjin 0.9.2644 on Jun 2, 2018.

Source

R

View GitHub Mirror

Release History