quitefastmst (Q7368849)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Euclidean and Mutual Reachability Minimum Spanning Trees
Language Label Description Also known as
default for all languages
No label defined
    English
    quitefastmst
    Euclidean and Mutual Reachability Minimum Spanning Trees

      Statements

      0 references
      0 references
      Functions to compute Euclidean minimum spanning trees using single-, sesqui-, and dual-tree Boruvka algorithms. Thanks to K-d trees, they are fast in spaces of low intrinsic dimensionality. Mutual reachability distances (used in the definition of the 'HDBSCAN*' algorithm) are supported too. The package also includes relatively fast fallback minimum spanning tree and nearest-neighbours algorithms for spaces of higher dimensionality. The 'Python' version of 'quitefastmst' is available via 'PyPI'.
      0 references
      28 September 2026
      0 references
      PACKAGES.rds
      28 September 2026
      0 references
      0.9.0
      23 July 2025
      0 references
      0.9.1
      11 February 2026
      0 references
      0.9.2
      28 September 2026
      0 references
      0 references
      0 references

      Identifiers

      0 references