mlpack_mst

data

<p>Fast computes an EMST using the <code>mlpack C++</code> library.</p>

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.

Allan Quadros

emstreeR

Fast Computing Euclidean Minimum Spanning Trees

Andre Cancado

Pedro Brom

Eduardo Hellas

mlpack_mst function

<code>mlpack</code>'s Euclidean Minimum Spanning Tree — mlpack_mst

<code>mlpack</code>'s Euclidean Minimum Spanning Tree

mlpack_mst: `mlpack`'s Euclidean Minimum Spanning Tree

Description

Usage

Arguments

Value