Fast Computing Euclidean Minimum Spanning Trees

Computes Euclidean Minimum Spanning Trees (EMST) using the Dual-Tree Boruvka algorithm (March, Ram, Gray, 2010, ) implemented in 'mlpack' - the C++ Machine Learning library (Curtin, 2005, ). 'emstreeR' heavily relies on 'RcppMLPACK' and 'Rcpp' to work as a wrapper, so that R users have access to the C++ fast EMST algorithm without having to deal with the R-'Rcpp'-C++ integration. 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.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


2.1.1 by Allan Quadros, a month ago

Report a bug at

Browse source code at

Authors: Allan Quadros [aut, cre] , Andre Cancado [ctb]

Documentation:   PDF Manual  

BSD_3_clause + file LICENSE license

Imports Rcpp, scatterplot3d, ggplot2, BBmisc

Linking to Rcpp, RcppMLPACK, RcppArmadillo, BH

System requirements: C++11 compiler.

See at CRAN