Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...
| License | MIT |
|---|---|
| Tags | graph |
| HomePage | https://github.com/tdebatty/java-graphs |
| Date | Apr 09, 2015 |
| Files | pom (5 KB) jar (50 KB) View All |
| Repositories | CentralSpring Lib ReleaseXceptance |
| Ranking | #103089 in MvnRepository (See Top Artifacts) |
| Used By | 4 artifacts |
Compile Dependencies (3)
| Category/License | Group / Artifact | Version | Updates | |
|---|---|---|---|---|
| String Utils MIT | | info.debatty » java-string-similarity | 0.8 | 2.0.0 |
MIT | | info.debatty » java-lsh | 0.4 | 0.12 |
| Hashing MIT | | info.debatty » java-spamsum | 0.1 | 0.2 |
Licenses
| License | URL |
|---|---|
| MIT License | http://www.opensource.org/licenses/mit-license.php |
Developers
| Name | Dev Id | Roles | Organization | |
|---|---|---|---|---|
| Thibault Debatty | thibault<at>debatty.info | debatty.info |