Package: emstreeR
Type: Package
Title: Tools for Fast Computing and Visualizing Euclidean Minimum
        Spanning Trees
Version: 3.1.3
Date: 2025-12-10
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 easy computation of Euclidean Minimum Spanning Trees (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 visualizing Minimum Spanning Trees (MST) using either the 
    style of the 'base', 'scatterplot3d', or 'ggplot2' libraries; and functions to export the MST output to shapefiles.
License: BSD_3_clause + file LICENSE
Encoding: UTF-8
Imports: mlpack, scatterplot3d, ggplot2, graphics, stats, sf
Depends: R (>= 3.5.0)
BugReports: https://github.com/allanvc/emstreeR/issues/
RoxygenNote: 7.2.3
NeedsCompilation: no
Packaged: 2025-12-17 15:43:55 UTC; allan
Author: Allan Quadros [aut, cre],
  Duncan Garmonsway [ctb]
Maintainer: Allan Quadros <allanvcq@gmail.com>
Repository: CRAN
Date/Publication: 2025-12-17 16:10:02 UTC
Built: R 4.6.0; ; 2026-04-26 07:13:43 UTC; unix
