Imports: Rcpp (>= 0.12.18), RcppMLPACK, scatterplot3d, ggplot2, BBmisc

Description: Computes Euclidean Minimum Spanning Trees (EMST) using the Dual-Tree
<doi:10.21105/joss.00726>). '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'

Title: Tools for Fast Computing and Plotting Euclidean Minimum Spanning
Description: 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,

Description: Fast and easily computes an Euclidean Minimum Spanning Tree (EMST) from data.
This package relies on 'RcppMLPACK' to provide an R interface to the 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). The Dual-Tree
Boruvka is theoretically and empirically the fastest algorithm for computing an EMST.
This package also provides functions and an S3 method for readily plotting Minimum
Spanning Trees (MST) using either the style of the 'base', 'scatterplot3d', or

person(given="Duncan", family="Garmonsway", email = "nacnudus@gmail.com",
Description: 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 plotting Minimum Spanning Trees (MST) using either the
style of the 'base', 'scatterplot3d', or 'ggplot2' libraries.
Imports: mlpack, scatterplot3d, ggplot2, BBmisc, graphics, stats