Package: emstreeR
Type: Package
Title: Tools for Fast Computing and Plotting Euclidean Minimum Spanning
        Trees
Version: 2.2.0
Date: 2019-05-07
Authors@R: c(
    person(given="Allan", family="Quadros", email = "allanvcq@gmail.com",
    role = c("aut", "cre")),
    person(given="Andre", family="Cancado", email = "cancado@unb.br", 
    role = c("ctb"))
    )
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, 
    'scatterplot3d' or 'ggplot2' style.
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: 6.1.1
NeedsCompilation: yes
Packaged: 2019-05-08 02:52:53 UTC; allan
Author: Allan Quadros [aut, cre],
  Andre Cancado [ctb]
Maintainer: Allan Quadros <allanvcq@gmail.com>
Repository: CRAN
Date/Publication: 2019-05-08 04:50:03 UTC
Built: R 4.0.0; x86_64-w64-mingw32; 2020-04-10 09:59:30 UTC; windows
Archs: i386, x64
