Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...
'info.debatty:java-graphs:0.9'
<dependency>
<groupId>info.debatty</groupId>
<artifactId>java-graphs</artifactId>
<version>0.9</version>
</dependency>
<dependency org="info.debatty" name="java-graphs" rev="0.9"/>
"info.debatty", "java-graphs", "0.9"