| Package | Description |
|---|---|
| info.debatty.java.graphs.build |
| Modifier and Type | Class and Description |
|---|---|
class |
Brute<T> |
class |
NNCTPH<T>
Builds the k-nn graph by partitioning the graph using Context Triggered
Piecewize Hashing.
|
class |
NNDescent<T>
Implementation of NN-Descent k-nn graph building algorithm.
|
class |
PartitioningGraphBuilder<T>
Abstract class for graph building algorithms that split the dataset into
partitions (for example using LSH).
|
class |
ThreadedBrute<T> |
class |
ThreadedNNDescent<T> |
| Modifier and Type | Method and Description |
|---|---|
GraphBuilder |
PartitioningGraphBuilder.getInternalBuilder() |
| Modifier and Type | Method and Description |
|---|---|
void |
PartitioningGraphBuilder.setInternalBuilder(GraphBuilder internal_builder)
Default = Brute force.
|
Copyright © 2017. All rights reserved.