CRAN

VertexSort 0.1-1

Network Hierarchical Structure and Randomization

Released Mar 9, 2017 by Diala Abd-Rabbo

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

Dependencies

snowfall 1.84-6.1 igraph 1.2.2

Permits to apply the 'Vertex Sort' algorithm (Jothi et al. (2009) <10.1038/msb.2009.52>) to a graph in order to elucidate its hierarchical structure. It also allows graphic visualization of the sorted graph by exporting the results to a cytoscape friendly format. Moreover, it offers five different algorithms of graph randomization: 1) Randomize a graph with preserving node degrees, 2) with preserving similar node degrees, 3) without preserving node degrees, 4) with preserving node in-degrees and 5) with preserving node out-degrees.

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>VertexSort</artifactId>
    <version>0.1-1-b18</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:VertexSort')

Test Results

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

Source

R

View GitHub Mirror

Release History