The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
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[@]dogado.de.

dgraphs

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.

Installation

Install the released package from CRAN with:

install.packages("dgraphs")

Example

library(dgraphs)

set.seed(1)
x <- matrix(rnorm(80), ncol = 2)
graph <- create.mknn.graph(x, k = 4)

graph$n_edges

For an end-to-end introduction to graph construction, connectivity repair, parameter sequences, conversion, and diagnostics, run:

vignette("data-derived-graph-workflow", package = "dgraphs")

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.
Health stats visible at Monitor.