CRAN

muRty 0.3.0

Murty's Algorithm for k-Best Assignments

Released May 26, 2019 by Aljaz Jelenko

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

Dependencies

clue 0.3-57 lpSolve 5.6.13.1

Calculates k-best solutions and costs for an assignment problem following the method outlined in Murty (1968) .

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>muRty</artifactId>
    <version>0.3.0-b1</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:muRty')

Test Results

This package was last tested against Renjin 0.9.2726 on Jul 13, 2019.

Source

R

View GitHub Mirror

Release History