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?
- Version1.3
- R versionunknown
- LicenseMIT
- LicenseLICENSE
- Needs compilation?No
- CTD citation info
- Last release08/16/2024
Documentation
Team
Varduhi Petrosyan
Lillian Thistlethwaite
Show author detailsRolesAuthor
Insights
Last 30 days
This package has been downloaded 231 times in the last 30 days. Now we're getting somewhere! Enough downloads to populate a lively group chat. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 7 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 3,304 times in the last 365 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The day with the most downloads was Aug 17, 2024 with 39 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends1 package
- Suggests7 packages