Package: emstreeR
Type: Package
Title: Tools for Fast Computing and Plotting Euclidean Minimum Spanning
        Trees
Version: 3.0.0
Date: 2022-03-17
Authors@R: c(
    person(given="Allan", family="Quadros", email = "allanvcq@gmail.com",
    role = c("aut", "cre")),
    person(given="Duncan", family="Garmonsway", email = "nacnudus@gmail.com",
    role = c("ctb"))
    )
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.
License: BSD_3_clause + file LICENSE
Encoding: UTF-8
Imports: mlpack, scatterplot3d, ggplot2, BBmisc, graphics, stats
Depends: R (>= 3.5.0)
BugReports: https://github.com/allanvc/emstreeR/issues/
RoxygenNote: 7.1.2
NeedsCompilation: no
Packaged: 2022-03-18 21:43:45 UTC; allan
Author: Allan Quadros [aut, cre],
  Duncan Garmonsway [ctb]
Maintainer: Allan Quadros <allanvcq@gmail.com>
Repository: CRAN
Date/Publication: 2022-03-21 08:50:06 UTC
Built: R 4.0.5; ; 2022-03-22 10:55:21 UTC; unix
