dgraphs constructs and analyzes graphs derived from
numerical observations. It includes mutual and shared-neighbor graphs,
intersection and geodesic nearest-neighbor graphs, radius and
adaptive-radius graphs, and minimum-spanning-tree completion. Utilities
for conversion, pruning, diagnostics, spectral embedding, endpoints, and
paths are also provided.
Once the package is available from CRAN, install it with:
install.packages("dgraphs")library(dgraphs)
set.seed(1)
x <- matrix(rnorm(80), ncol = 2)
graph <- create.mknn.graph(x, k = 4)
length(graph$adjacency.list)
Need a high-speed mirror for your open-source project?
Contact our mirror admin team at info@clientvps.com.
This archive is provided as a free public service to the community.
Proudly supported by infrastructure from VPSPulse , RxServers , BuyNumber , UnitVPS , OffshoreName and secure payment technology by ArionPay.