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 AlmeidaNeto et al. (2008) <doi:10.1111/j.00301299.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.
Package details 


Author  Christoph Hoeppke [aut, cre], Benno Simmons [aut] 
Maintainer  Christoph Hoeppke <christoph.hoeppke@googlemail.com> 
License  MIT + file LICENSE 
Version  1.0.0 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.