CTD: A Method for 'Connecting The Dots' in Weighted Graphs

A method for pattern discovery in weighted graphs. 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: 0.99.8
Depends: R (≥ 4.0), gmp, igraph, stats, grDevices, graphics
Suggests: knitr, rmarkdown, huge, ggplot2, gplots, RColorBrewer, testthat
Published: 2020-10-16
Author: Lillian Thistlethwaite [aut, cre]
Maintainer: Lillian Thistlethwaite <lillian.thistlethwaite at bcm.edu>
License: MIT + file LICENSE
NeedsCompilation: no
SystemRequirements: gmp (>=5.0)
Materials: README NEWS
CRAN checks: CTD results


Reference manual: CTD.pdf
Vignettes: CTD Lab Exercise
Package source: CTD_0.99.8.tar.gz
Windows binaries: r-devel: CTD_0.99.8.zip, r-release: CTD_0.99.8.zip, r-oldrel: not available
macOS binaries: r-release: CTD_0.99.8.tgz, r-oldrel: not available


Please use the canonical form https://CRAN.R-project.org/package=CTD to link to this page.