| Interface | Description |
|---|---|
| CallbackInterface | |
| SimilarityInterface<T> |
| Class | Description |
|---|---|
| Dijkstra<T> |
Compute the shortest path (measured as the number of 'hops' from this source
node to every other node in the graph using Dijkstra algorithm.
|
| Edge<T> |
Represent a weighted edge (a link from node n1 to node n2).
|
| FastSearchConfig | |
| FastSearchResult<T> | |
| Graph<T> |
k-nn graph, represented as a mapping node => neighborlist.
|
| Neighbor<T> |
Neighbor of an edge (stores the other node, and the similarity).
|
| NeighborList |
Bounded list of neighbors.
|
| OnlineConfig | |
| StatisticsContainer |
This object will contain additional stats produced by fastSearch, fastAdd and
fastRemove algorithms.
|
Copyright © 2017. All rights reserved.