gagolews/quitefastmst: quitefastmst_0.9.1

Read full text
Authors: Marek Ga̧golewski
Cited by: 0

Abstract

0.9.1 (2026-02-11) [NEW FEATURE] The mutreach_leaves argument to mst_euclid controls the postprocessing of tree leaves. [BACKWARD INCOMPATIBILITY] The definition of the mutual reachability distance has changed (for notational prudence). Unlike in Campello et al.'s 2013 paper, now the core distance is the distance to the M-th nearest neighbour, not the (M-1)-th one (not including self). [BACKWARD INCOMPATIBILITY] The mutreach_adj argument to mst_euclid was removed. Instead, the mutreach_ties argument is now available. It defaults to "dist_min" for (rough) compatibility with other packages. [BUGFIX] #3: SIGSEGV on duplicated inputs in mst_euclid with algorithm="brute" was fixed.

Fields of Study & Subjects

Advanced Clustering Algorithms Research Computational Geometry and Mesh Generation Complexity and Algorithms in Graphs

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
11 February 2026
Language
EN