| Interface | Description |
|---|---|
| CallbackInterface | |
| SimilarityInterface<t> |
| Class | Description |
|---|---|
| Dijkstra |
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 |
Represent a weighted edge (a link from node n1 to node n2)
|
| Graph<T> |
k-nn graph, represented as a mapping node => neighborlist
|
| Neighbor |
Neighbor of an edge (stores the other node, and the similarity)
|
| NeighborList |
Bounded list of neighbors
|
| Node<T> |
The nodes of a graph have an id (String) and a value (type T)
|
Copyright © 2015. All rights reserved.