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.

Getting started

Package details

AuthorChristoph Hoeppke [aut, cre], Benno Simmons [aut]
MaintainerChristoph Hoeppke <>
LicenseMIT + file LICENSE
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the maxnodf package in your browser

Any scripts or data that you put into this service are public.

maxnodf documentation built on March 13, 2020, 5:06 p.m.