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) . 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.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.0.0 by Christoph Hoeppke, 7 months ago

Browse source code at

Authors: Christoph Hoeppke [aut, cre] , Benno Simmons [aut]

Documentation:   PDF Manual  

MIT + file LICENSE license

Imports Rcpp, stats, utils

Suggests testthat, covr

Linking to Rcpp

See at CRAN