Package info.debatty.java.graphs.build

Class Summary

Class	Description
Brute<T>
GraphBuilder<T>
NNCTPH<T>	Builds the k-nn graph by partitioning the graph using Context Triggered Piecewize Hashing.
NNDescent<T>	Implementation of NN-Descent k-nn graph building algorithm.
PartitioningGraphBuilder<T>	Abstract class for graph building algorithms that split the dataset into partitions (for example using LSH).
SimilarityCounter<T>	Wraps a similarity interface with a counter, so we can check how many similarities were computed.
ThreadedBrute<T>
ThreadedNNDescent<T>