Package: CTD
Title: A Method for 'Connecting The Dots' in Weighted Graphs
Version: 1.0.0
Date: 2021-02-10
Authors@R: person("Lillian", "Thistlethwaite", email="lillian.thistlethwaite@gmail.com", role=c("aut", "cre"))
Description: A method for pattern discovery in weighted graphs as outlined in Thistlethwaite et al. (2021) <doi:10.1371/journal.pcbi.1008550>. Two use cases are achieved: 1) Given a weighted graph and a subset of its nodes, do the nodes show significant connectedness? 2) Given a weighted graph and two subsets of its nodes, are the subsets close neighbors or distant?
Depends: R (>= 4.0), gmp, igraph, stats, grDevices, graphics
Suggests: knitr, rmarkdown, huge, ggplot2, gplots, RColorBrewer,
        testthat
SystemRequirements: gmp (>=5.0)
VignetteBuilder: knitr
License: MIT + file LICENSE
Encoding: UTF-8
LazyData: true
RoxygenNote: 7.1.1
NeedsCompilation: no
Packaged: 2021-03-09 01:38:28 UTC; lillian.rosa
Author: Lillian Thistlethwaite [aut, cre]
Maintainer: Lillian Thistlethwaite <lillian.thistlethwaite@gmail.com>
Repository: CRAN
Date/Publication: 2021-03-09 14:20:07 UTC
Built: R 4.0.2; ; 2021-03-10 11:47:26 UTC; unix
