| Name : R-emstreeR
| |
| Version : 3.1.2
| Vendor : obs://build_opensuse_org/devel:languages:R
|
| Release : lp155.1.1
| Date : 2024-09-10 14:10:05
|
| Group : Development/Libraries/Other
| Source RPM : R-emstreeR-3.1.2-lp155.1.1.src.rpm
|
| Size : 0.05 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : 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.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/R:/autoCRAN/15.5/x86_64 |
