The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.

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 + file LICENSE
NeedsCompilation: no
Citation: CTD citation info
Materials: README NEWS
CRAN checks: CTD results

Documentation:

Reference manual: CTD.pdf

Downloads:

Package source: CTD_1.3.tar.gz
Windows binaries: r-devel: CTD_1.3.zip, r-release: CTD_1.3.zip, r-oldrel: CTD_1.3.zip
macOS binaries: r-release (arm64): CTD_1.3.tgz, r-oldrel (arm64): CTD_1.3.tgz, r-release (x86_64): CTD_1.3.tgz, r-oldrel (x86_64): CTD_1.3.tgz
Old sources: CTD archive

Linking:

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

These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.