/
DESCRIPTION
28 lines (28 loc) · 1.2 KB
/
DESCRIPTION
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
Package: emstreeR
Type: Package
Title: Tools for Fast Computing and Visualizing Euclidean Minimum Spanning Trees
Version: 3.1.2
Date: 2023-11-13
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 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