emstreeR: Fast Computing Euclidean Minimum Spanning Trees

Computes an Euclidean Minimum Spanning Tree using the Dual-Tree Boruvka algorithm (March, Ram, Gray, 2010, <doi:10.1145/1835804.1835882>) implemented in 'mlpack' - the C++ Machine Learning library (Curtin, 2005, <doi:10.21105/joss.00726>). 'emstreeR' works as a wrapper so that R users can benefit from the fast C++ function for computing an Euclidean Minimum Spanning Tree without touching the C++ code. The package also provides functions and an S3 method for readily plotting the Minimum Spanning Trees (MST) using either 'base' R, 'scatterplot3d' or 'ggplot2' style.

Version: 2.1.0
Depends: R (≥ 3.5.0)
Imports: Rcpp (≥ 0.12.18), RcppMLPACK, scatterplot3d, ggplot2, BBmisc
LinkingTo: Rcpp, RcppMLPACK, RcppArmadillo, BH
Published: 2018-12-06
Author: Allan Quadros [aut, cre], Andre Cancado [aut], Pedro Brom [aut], Eduardo Hellas [aut]
Maintainer: Allan Quadros <allanvcq at gmail.com>
BugReports: https://github.com/allanvc/emstreeR/issues
License: BSD_3_clause + file LICENSE
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: emstreeR results


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


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