A Cost-Minimal Regular Spanning Subgraph with TreeClust
Released Aug 13, 2016 by Dave Ruth, Sam Buttrey
Construct minimum-cost regular spanning subgraph as part of a non-parametric two-sample test for equality of distribution.
This package can be included as a dependency from a Java or Scala project by including
the following your project's
about embedding Renjin in JVM-based projects.
<dependencies> <dependency> <groupId>org.renjin.cran</groupId> <artifactId>AcrossTic</artifactId> <version>1.0-3-b8</version> </dependency> </dependencies> <repositories> <repository> <id>bedatadriven</id> <name>bedatadriven public repo</name> <url>https://nexus.bedatadriven.com/content/groups/public/</url> </repository> </repositories>
If you're using Renjin from the command line, you load this library by invoking:
This package was last tested against Renjin 0.8.2361 on May 29, 2017.