T - type of nodes in the graphpublic class FastSearchResult<T> extends Object implements Serializable
| Constructor and Description |
|---|
FastSearchResult(int k)
Initialize a result for a NN list of size k.
|
| Modifier and Type | Method and Description |
|---|---|
void |
add(FastSearchResult<T> other)
Append the result contained in the other result to this object.
|
void |
addAll(List<FastSearchResult<T>> others)
Append all other results to this object.
|
T |
getBoundaryNode()
If we stopped searching because of a boundary, this will contain
the boundary node.
|
int |
getBoundaryRestarts()
Number of restarts because we reached the boundary of the partition.
|
NeighborList |
getNeighbors()
Get the k most similar neighbors that we found.
|
int |
getRestarts()
Number of restarts because we reached a local maximum.
|
int |
getSimilarities()
Number of computed similarities.
|
String |
toString() |
public FastSearchResult(int k)
k - public final int getSimilarities()
public final int getRestarts()
public final int getBoundaryRestarts()
public final NeighborList getNeighbors()
public final T getBoundaryNode()
public final void add(FastSearchResult<T> other)
other - public final void addAll(List<FastSearchResult<T>> others)
others - Copyright © 2017. All rights reserved.