vptversion Documentation on ocaml.org
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 metric (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/v3.0.0.tar.gz sha256=92799a8dc0365b616ecd619a01aea470749beca005001ff78dffc9f6d8b4fc4c md5=172f210c7ac22193f26a96472f8fb1e4 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/vpt/vpt.3.0.0/opam |
Required by
- lbvs_consent>=2.1.3
