CRAN/E | CTD

CTD

A Method for 'Connecting The Dots' in Weighted Graphs

Installation

About

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?

Citation CTD citation info

Key Metrics

Version 1.2
R ≥ 4.0
Published 2023-10-24 172 days ago
Needs compilation? no
License MIT
License File
CRAN checks CTD results

Downloads

Yesterday 2 -71%
Last 7 days 37 -50%
Last 30 days 232 +5%
Last 90 days 889 +33%
Last 365 days 1.937 +144%

Maintainer

Maintainer

Varduhi Petrosyan

varduhi.petrosyan@bcm.edu

Authors

Varduhi
Petrosyan[aut
cre]
Lillian
Thistlethwaite

aut / cre

Material

README
NEWS
Reference manual
Package source

Vignettes

CTD Lab Exercise

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-develnot available

x86_64

r-releasenot available

x86_64

r-oldrelnot available

x86_64

Old Sources

CTD archive

Depends

R ≥ 4.0
igraph
stats
grDevices
graphics

Suggests

knitr
rmarkdown
huge
ggplot2
gplots
RColorBrewer
testthat