Changelog¶

To Do¶

[HELP NEEDED] [Python] Set up OpenMP on macOS. TODO: https://gist.github.com/FirefoxMetzger/b10a215204732ebf0a2cc34b15b89039 ?
Parallelise the K-d tree building procedure.
Extend the online documentation: Tutorials, benchmarks, definitions.
Instruct how to build the Python package from sources.

[PERFORMANCE] mst_euclid asks for the OpenMP lock less frequently.
[BACKWARD INCOMPATIBILITY] mutreach_ties is now available only for the brute-force algorithm.
[BUGFIX] genieclust/#94: Assertion _leafnum == this->nleaves failed in c_kdtree_boruvka.h:399 (thanks to @drobertsicl for the report).

[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.