# --------------------------------------------
# CITATION file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# --------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "quitefastmst" in publications use:'
type: software
license: AGPL-3.0-only
title: 'quitefastmst: Euclidean and Mutual Reachability Minimum Spanning Trees'
version: 0.9.1
doi: 10.32614/CRAN.package.quitefastmst
abstract: 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'.
authors:
- family-names: Gagolewski
  given-names: Marek
  email: marek@gagolewski.com
  orcid: https://orcid.org/0000-0003-0637-6028
repository: https://cran.r-universe.dev
repository-code: https://github.com/gagolews/quitefastmst
commit: 958abe7644faac2dc70db376340f7056323dcb87
url: https://quitefastmst.gagolewski.com/
date-released: '2026-02-11'
contact:
- family-names: Gagolewski
  given-names: Marek
  email: marek@gagolewski.com
  orcid: https://orcid.org/0000-0003-0637-6028