minivptversion
Minimalist vantage point tree implementation in OCaml
A vantage point tree allows to do fast but exact nearest neighbor searches in any space provided that you have a distance function to measure the distance between any two points in that space.
| Author | Francois BERENGER |
|---|---|
| License | BSD-3-Clause |
| Published | |
| Homepage | https://github.com/UnixJunkie/vp-tree |
| Issue Tracker | https://github.com/UnixJunkie/vp-tree/issues |
| Maintainer | unixjunkie@sdf.org |
| Dependencies | |
| Source [http] | https://github.com/UnixJunkie/vp-tree/archive/v2.0.0.tar.gz sha256=80b2e2cff1f6e3be0afe75e240af2682f61f5c165d3d5fc4ae2f506169a2c5f7 md5=cf6a8edaaa70409db489510fe6dd9785 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/minivpt/minivpt.2.0.0/opam |
Required by
- lbvs_consent<2.1.3
