VertexSort: Network Hierarchical Structure and Randomization

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.

Version: 0.1-1
Depends: R (≥ 3.3.2), igraph, snowfall
Published: 2017-03-09
Author: Diala Abd-Rabbo
Maintainer: Diala Abd-Rabbo <diala.abd.rabbo at>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: no
CRAN checks: VertexSort results


Reference manual: VertexSort.pdf
Package source: VertexSort_0.1-1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X El Capitan binaries: r-release: VertexSort_0.1-1.tgz
OS X Mavericks binaries: r-oldrel: VertexSort_0.1-1.tgz
Old sources: VertexSort archive


Please use the canonical form to link to this page.