CHoeppke/maxnodf: Approximate NODF-maximising graphs

This package contains functions to generate graphs that maximise the NODF metric for a given number of rows, columns and links. As nestedness in ecological networks depends on the size of the networks we require normalisation to make them comparable [1]. We offer three highly optimised algorithms to find the optimising graphs so that users can choose an appropriate trade off between computation time and NODF value for the task at hand. [1] Chuliang Song, Rudolf P. Rohr, and Serguei Saavedra. Why are some plantpollinator networks more nested than others? Journal of Animal Ecology, 86(6):1417–1424.

Getting started

Package details

Maintainer
LicenseMIT + file LICENSE
Version0.2.0.9000
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
install.packages("devtools")
library(devtools)
install_github("CHoeppke/maxnodf")
CHoeppke/maxnodf documentation built on Aug. 19, 2018, 3:42 a.m.