dgraphs - Data-Derived Graph Construction Utilities
Constructs data-derived graphs from numerical observations
using mutual, shared-neighbor, intersection, geodesic, radius,
adaptive-radius, minimum-spanning-tree completion, and optional
iterated adaptive neighborhood methods. Provides graph
conversion, pruning, diagnostics, spectral embedding, endpoint
detection, and path utilities, with reproducible synthetic
geometries and point sampling for graph and embedding
experiments. The implemented graph constructions include
methods described by Jarvis and Patrick (1973)
<doi:10.1109/T-C.1973.223640>, Brito et al. (1997)
<doi:10.1016/S0167-7152(96)00213-1>, Berry and Sauer (2019)
<doi:10.3934/fods.2019001>, and Gower and Ross (1969)
<doi:10.2307/2346439>.