mvncenter: info.debatty:java-graphs:0.41

Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...

that brute neighbors graph descent algorithms force build nearest

文件下载

Apache Maven

<dependency>
  <groupId>info.debatty</groupId>
  <artifactId>java-graphs</artifactId>
  <version>0.41</version>
</dependency>

Gradle Groovy

implementation 'info.debatty:java-graphs:0.41'

Gradle Kotlin

implementation("info.debatty:java-graphs:0.41")

Scala SBT

libraryDependencies += "info.debatty" % "java-graphs" % "0.41"

Groovy Grape

@Grapes(
  @Grab(group='info.debatty', module='java-graphs', version='0.41')
)

Apache Ivy

<dependency org="info.debatty" name="java-graphs" rev="0.41" />

Leiningen

[info.debatty/java-graphs "0.41"]

Apache Buildr

'info.debatty:java-graphs:jar:0.41'

本项目依赖

compile

test