_            _    _        _         _
      /\ \         /\ \ /\ \     /\_\      / /\
      \_\ \       /  \ \\ \ \   / / /     / /  \
      /\__ \     / /\ \ \\ \ \_/ / /     / / /\ \__
     / /_ \ \   / / /\ \ \\ \___/ /     / / /\ \___\
    / / /\ \ \ / / /  \ \_\\ \ \_/      \ \ \ \/___/
   / / /  \/_// / /   / / / \ \ \        \ \ \
  / / /      / / /   / / /   \ \ \   _    \ \ \
 / / /      / / /___/ / /     \ \ \ /_/\__/ / /
/_/ /      / / /____\/ /       \ \_\\ \/___/ /
\_\/       \/_________/         \/_/ \_____\/
r-emstreer 3.1.2
Propagated dependencies: r-sf@1.0-21 r-scatterplot3d@0.3-44 r-mlpack@4.6.2 r-ggplot2@3.5.2
Channel: guix-cran
Location: guix-cran/packages/e.scm (guix-cran packages e)
Home page: https://cran.r-project.org/package=emstreeR
Licenses: Modified BSD
Synopsis: Tools for Fast Computing and Visualizing Euclidean Minimum Spanning Trees
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.

Total results: 1