Package: emstreeR 3.1.2

Allan Quadros

emstreeR: Tools for Fast Computing and Visualizing Euclidean Minimum Spanning Trees

Fast and easily computes an Euclidean Minimum Spanning Tree (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.

Authors:Allan Quadros [aut, cre], Duncan Garmonsway [ctb]

emstreeR_3.1.2.tar.gz
emstreeR_3.1.2.zip(r-4.5)emstreeR_3.1.2.zip(r-4.4)emstreeR_3.1.2.zip(r-4.3)
emstreeR_3.1.2.tgz(r-4.4-any)emstreeR_3.1.2.tgz(r-4.3-any)
emstreeR_3.1.2.tar.gz(r-4.5-noble)emstreeR_3.1.2.tar.gz(r-4.4-noble)
emstreeR_3.1.2.tgz(r-4.4-emscripten)emstreeR_3.1.2.tgz(r-4.3-emscripten)
emstreeR.pdf |emstreeR.html✨
emstreeR/json (API)

Peer review:

Bug tracker:https://github.com/allanvc/emstreer/issues

On CRAN:

6 exports 7 stars 1.66 score 43 dependencies 1 dependents 15 scripts 412 downloads

Last updated 10 months agofrom:c2379ef6ea. Checks:OK: 7. Indexed: yes.

Exports:ComputeMSTexport_edges_to_shapefileexport_vertices_to_shapefileplotMST3Dstat_MSTStatMST

Dependencies:classclassIntclicolorspaceDBIe1071fansifarverggplot2gluegtableisobandKernSmoothlabelinglatticelifecyclemagrittrMASSMatrixmgcvmlpackmunsellnlmepillarpkgconfigproxyR6RColorBrewerRcppRcppArmadilloRcppEnsmallenrlangs2scalesscatterplot3dsftibbleunitsutf8vctrsviridisLitewithrwk