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

Computes Euclidean Minimum Spanning Trees (EMST) using the fast Dual-Tree Boruvka algorithm (March, Ram, Gray, 2010, <doi:10.1145/1835804.1835882>) implemented in 'mlpack' - the C++ Machine Learning library (Curtin et al., 2013). 'emstreeR' heavily relies on 'RcppMLPACK' and 'Rcpp', working as a wrapper to the C++ fast EMST algorithm. Thus, R users do not have to deal with the R-'Rcpp'-C++ integration. The package also provides functions and an S3 method for readily plotting Minimum Spanning Trees (MST) using either 'base' R, 'scatterplot3d' or 'ggplot2' style.

Version: 2.1.2
Depends: R (≥ 3.5.0)
Imports: Rcpp (≥ 0.12.18), scatterplot3d, ggplot2, BBmisc
LinkingTo: Rcpp, RcppMLPACK, RcppArmadillo, BH
Published: 2019-03-17
Author: Allan Quadros [aut, cre], Andre Cancado [ctb]
Maintainer: Allan Quadros <allanvcq at gmail.com>
BugReports: https://github.com/allanvc/emstreeR/issues
License: BSD_3_clause + file LICENSE
NeedsCompilation: yes
SystemRequirements: C++11 compiler.
Materials: README NEWS
CRAN checks: emstreeR results

Downloads:

Reference manual: emstreeR.pdf
Package source: emstreeR_2.1.2.tar.gz
Windows binaries: r-devel: emstreeR_2.1.1.zip, r-release: emstreeR_2.1.1.zip, r-oldrel: not available
OS X binaries: r-release: emstreeR_2.1.1.tgz, r-oldrel: not available
Old sources: emstreeR archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=emstreeR to link to this page.