Package: maxnodf
Title: Approximate Maximisation of Nestedness in Bipartite Graphs
Version: 1.0.0
Authors@R: c(person("Christoph ", "Hoeppke", email = "christoph.hoeppke@googlemail.com", role = c("aut", "cre")),
    person("Benno ", "Simmons", email = "benno.simmons@gmail.com", role = c("aut")))
Description: 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.
Depends: R (>= 3.4.0)
License: MIT + file LICENSE
Encoding: UTF-8
LazyData: true
RoxygenNote: 7.0.2
LinkingTo: Rcpp
Imports: Rcpp (>= 0.12.18), stats (>= 3.4.4), utils (>= 3.4.4),
Suggests: testthat, covr
NeedsCompilation: yes
Packaged: 2020-03-05 15:37:57 UTC; bennosimmons
Author: Christoph Hoeppke [aut, cre],
  Benno Simmons [aut]
Maintainer: Christoph  Hoeppke <christoph.hoeppke@googlemail.com>
Repository: CRAN
Date/Publication: 2020-03-13 11:10:02 UTC
Built: R 4.0.2; x86_64-apple-darwin17.0; 2020-07-15 16:02:11 UTC; unix
Archs: maxnodf.so.dSYM
