emstreeR
Tools for Fast Computing and Visualizing Euclidean Minimum Spanning Trees
Fast and easy computation of Euclidean Minimum Spanning Trees (EMST) from data, relying on the R API for 'mlpack' - the C++ Machine Learning Library (Curtin et. al., 2013). 'emstreeR' uses the Dual-Tree Boruvka (March, Ram, Gray, 2010, <doi:10.1145/1835804.1835882>), which is theoretically and empirically the fastest algorithm for computing an EMST. This package also provides functions and an S3 method for readily visualizing Minimum Spanning Trees (MST) using either the style of the 'base', 'scatterplot3d', or 'ggplot2' libraries; and functions to export the MST output to shapefiles.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
3.1.3 |
rolling source/ R- | emstreeR_3.1.3.tar.gz |
961.6 KiB |
3.1.3 |
latest source/ R- | emstreeR_3.1.3.tar.gz |
961.6 KiB |
3.1.3 |
2026-04-09 windows/windows R-4.5 | emstreeR_3.1.3.zip |
50.7 KiB |