A cover tree is a data structure for efficiently finding nearest neighbors in a data set. This library implementation is based on the design outlined here:
https://izbicki.me/public/papers/icml2015-faster-cover-trees.pdf
A Rust implementation of a cover tree.
A cover tree is a data structure for efficiently finding nearest neighbors in a data set. This library implementation is based on the design outlined here:
https://izbicki.me/public/papers/icml2015-faster-cover-trees.pdf
A Rust implementation of a cover tree.
Apache License 2.0