Package: CTD
Title: A Method for 'Connecting The Dots' in Weighted Graphs
Version: 1.3
Date: 2024-08-15
Description: 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?
Depends: R (>= 4.0), igraph, stats, grDevices, graphics
Suggests: knitr, rmarkdown, huge, ggplot2, gplots, RColorBrewer,
        testthat
Authors@R: c(person("Varduhi","Petrosyan",email = "varduhi.petrosyan@bcm.edu",role = c("aut", "cre")),person("Lillian","Thistlethwaite",email = "lillian.thistlethwaite@gmail.com",role="aut"))
License: MIT + file LICENSE
Encoding: UTF-8
LazyData: true
RoxygenNote: 7.1.2
NeedsCompilation: no
Packaged: 2026-10-01 10:02:20 UTC; root
Author: Varduhi Petrosyan [aut, cre], Lillian Thistlethwaite [aut]
Maintainer: Varduhi Petrosyan <varduhi.petrosyan@bcm.edu>
Config/pak/sysreqs: libglpk-dev libxml2-dev
Repository: https://vpetrosyan.r-universe.dev
Date/Publication: 2024-08-17 02:44:16 UTC
RemoteUrl: https://github.com/cran/CTD
RemoteRef: HEAD
RemoteSha: 8ced1dbae4cddfecb3d0b850adea458d3466c81a