maxnodf: Approximate Maximisation of Nestedness in Bipartite Graphs

Functions to generate graphs that maximise the NODF (nestedness metric based on overlap and decreasing fill) metric for a given number of rows, columns and links. NODF was originally defined by Almeida-Neto et al. (2008) <doi:10.1111/j.0030-1299.2008.16644.x>. As nestedness in ecological networks depends on the size of the networks we require normalisation to make them comparable. 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.

Version: 1.0.0
Depends: R (≥ 3.4.0)
Imports: Rcpp (≥ 0.12.18), stats (≥ 3.4.4), utils (≥ 3.4.4)
LinkingTo: Rcpp
Suggests: testthat, covr
Published: 2020-03-13
DOI: 10.32614/CRAN.package.maxnodf
Author: Christoph Hoeppke [aut, cre], Benno Simmons [aut]
Maintainer: Christoph Hoeppke <christoph.hoeppke at>
License: MIT + file LICENSE
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: maxnodf results


Reference manual: maxnodf.pdf


Package source: maxnodf_1.0.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): maxnodf_1.0.0.tgz, r-oldrel (arm64): maxnodf_1.0.0.tgz, r-release (x86_64): maxnodf_1.0.0.tgz, r-oldrel (x86_64): maxnodf_1.0.0.tgz


Please use the canonical form to link to this page.