CRAN/E | emstreeR

emstreeR

Tools for Fast Computing and Visualizing Euclidean Minimum Spanning Trees

Installation

About

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.

Bug report File report

Key Metrics

Version 3.1.2
R ≥ 3.5.0
Published 2023-11-14 136 days ago
Needs compilation? no
License BSD_3_clause
License File
CRAN checks emstreeR results

Downloads

Yesterday 22 0%
Last 7 days 54 -25%
Last 30 days 295 -20%
Last 90 days 1.186 -15%
Last 365 days 4.434 -0%

Maintainer

Maintainer

Allan Quadros

allanvcq@gmail.com

Authors

Allan Quadros

aut / cre

Duncan Garmonsway

ctb

Material

README
Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

emstreeR archive

Depends

R ≥ 3.5.0

Imports

mlpack
scatterplot3d
ggplot2
graphics
stats
sf

Reverse Imports

wflo