CTD: A Method for 'Connecting The Dots' in Weighted Graphs
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.3 |
| Depends: | R (≥ 4.0),igraph, stats, grDevices, graphics |
| Suggests: | knitr,rmarkdown,huge,ggplot2,gplots,RColorBrewer,testthat |
| Published: | 2024-08-16 |
| DOI: | 10.32614/CRAN.package.CTD |
| Author: | Varduhi Petrosyan [aut, cre], Lillian Thistlethwaite [aut] |
| Maintainer: | Varduhi Petrosyan <varduhi.petrosyan at bcm.edu> |
| License: | MIT + fileLICENSE |
| NeedsCompilation: | no |
| Citation: | CTD citation info |
| Materials: | README,NEWS |
| CRAN checks: | CTD results |
Documentation:
Downloads:
Linking:
Please use the canonical formhttps://CRAN.R-project.org/package=CTDto link to this page.