Package: emstreeR
Type: Package
Title: Tools for Fast Computing and Plotting Euclidean Minimum Spanning
        Trees
Version: 2.2.2
Date: 2020-11-28
Authors@R: c(
    person(given="Allan", family="Quadros", email = "allanvcq@gmail.com",
    role = c("aut", "cre"))
    )
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 
    'ggplot2' libraries.
License: BSD_3_clause + file LICENSE
Encoding: UTF-8
Imports: Rcpp (>= 0.12.18), scatterplot3d, ggplot2, BBmisc
Depends: R (>= 3.5.0)
LinkingTo: Rcpp, RcppMLPACK, RcppArmadillo, BH
BugReports: https://github.com/allanvc/emstreeR/issues/
SystemRequirements: C++11 compiler.
RoxygenNote: 7.1.1
NeedsCompilation: yes
Packaged: 2020-11-30 12:45:03 UTC; allan
Author: Allan Quadros [aut, cre]
Maintainer: Allan Quadros <allanvcq@gmail.com>
Repository: CRAN
Date/Publication: 2020-11-30 13:40:03 UTC
Built: R 3.6.2; x86_64-apple-darwin15.6.0; 2020-12-01 09:14:17 UTC; unix
Archs: emstreeR.so.dSYM
