Package: emstreeR
Type: Package
Title: Fast Computing Euclidean Minimum Spanning Trees
Version: 2.0.0
Date: 2018-11-15
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")),
    person(given="Pedro", family="Brom", email = "pcbrom@gmail.com", 
    role = c("ctb")),
    person(given="Eduardo", family="Hellas", email = "ehellas@gmail.com", 
    role = c("ctb"))
    )
Description: Computes an Euclidean Minimum Spanning Tree 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' works as a wrapper so that R users 
    can benefit from the fast C++ function for computing an Euclidean Minimum 
    Spanning Tree without touching the C++ code. 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
RoxygenNote: 6.1.0
NeedsCompilation: yes
Packaged: 2018-11-28 19:52:28 UTC; allan
Author: Allan Quadros [aut, cre],
  Andre Cancado [ctb],
  Pedro Brom [ctb],
  Eduardo Hellas [ctb]
Maintainer: Allan Quadros <allanvcq@gmail.com>
Repository: CRAN
Date/Publication: 2018-12-03 19:40:12 UTC
