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/v1.0.0.tar.gz sha256=141f0f816b8c13153aa771548dd4cb13e68661d4fb5a24015688e1ef369e7518 md5=a0c73fcfc720be90e69aa30be94b80d6 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/minivpt/minivpt.1.0.0/opam |
Required by
- lbvs_consent<2.1.1
