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?
| Version: | 1.0.0 |
| Depends: | R (≥ 4.0), gmp, igraph, stats, grDevices, graphics |
| Suggests: | knitr, rmarkdown, huge, ggplot2, gplots, RColorBrewer, testthat |
| Published: | 2021-03-09 |
| Author: | Lillian Thistlethwaite [aut, cre] |
| Maintainer: | Lillian Thistlethwaite <lillian.thistlethwaite at gmail.com> |
| License: | MIT + file LICENSE |
| NeedsCompilation: | no |
| SystemRequirements: | gmp (>=5.0) |
| Citation: | CTD citation info |
| Materials: | README NEWS |
| CRAN checks: | CTD results |
| Reference manual: | CTD.pdf |
| Vignettes: |
CTD Lab Exercise |
| Package source: | CTD_1.0.0.tar.gz |
| Windows binaries: | r-devel: CTD_1.0.0.zip, r-release: CTD_1.0.0.zip, r-oldrel: not available |
| macOS binaries: | r-release: CTD_1.0.0.tgz, r-oldrel: not available |
| Old sources: | CTD archive |
Please use the canonical form https://CRAN.R-project.org/package=CTD to link to this page.