Package: emstreeR
Type: Package
Title: Fast Computing Euclidean Minimum Spanning Trees
Version: 2.1.1
Date: 2019-01-19
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 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' 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.
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.0
NeedsCompilation: yes
Packaged: 2019-01-19 22:39:15 UTC; allan
Author: Allan Quadros [aut, cre],
  Andre Cancado [ctb]
Maintainer: Allan Quadros <allanvcq@gmail.com>
Repository: CRAN
Date/Publication: 2019-01-19 23:00:03 UTC
