CRAN

Datasmith 1.0-1

Tools to Complete Euclidean Distance Matrices

Released Jan 6, 2017 by Adam Rahman

Dependencies

lbfgs 1.2.1 truncnorm 1.0-8 vegan 2.5-2 MASS 7.3-50 igraph 1.2.2 nloptr 1.0.4 Matrix 1.2-14

Implements several algorithms for Euclidean distance matrix completion, Sensor Network Localization, and sparse Euclidean distance matrix completion using the minimum spanning tree.

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>Datasmith</artifactId>
    <version>1.0-1-b25</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:Datasmith')

Test Results

This package was last tested against Renjin 0.9.2689 on Aug 26, 2018.

• colamdR-examples
• dpf-examples
• edm2gram-examples
• edm2psd-examples
• getConfig-examples
• gram2edm-examples
• grs-examples
• mst-examples
• mstLB-examples
• mstUB-examples
• npf-examples
• primPath-examples
• psd2edm-examples
• rgrs-examples
• sdp-examples
• snl-examples

Source

View GitHub Mirror

Release History

• 1.0-1