dgraphs
Data-Derived Graph Construction Utilities
Constructs data-derived graphs from numerical observations using mutual, shared-neighbor, intersection, geodesic, radius, adaptive-radius, and minimum-spanning-tree completion methods. Provides graph conversion, pruning, diagnostics, spectral embedding, endpoint detection, and path utilities. 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>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | dgraphs_0.1.0.tar.gz |
1.3 MiB |
0.1.0 |
rolling linux/noble R-4.5 | dgraphs_0.1.0.tar.gz |
1.3 MiB |
0.1.0 |
rolling source/ R- | dgraphs_0.1.0.tar.gz |
523.2 KiB |
0.1.0 |
latest linux/jammy R-4.5 | dgraphs_0.1.0.tar.gz |
1.3 MiB |
0.1.0 |
latest linux/noble R-4.5 | dgraphs_0.1.0.tar.gz |
1.3 MiB |
0.1.0 |
latest source/ R- | dgraphs_0.1.0.tar.gz |
523.2 KiB |
0.1.0 |
2026-04-23 source/ R- | dgraphs_0.1.0.tar.gz |
0 B |