| Package | Description |
|---|---|
| info.debatty.java.graphs |
| Modifier and Type | Method and Description |
|---|---|
NeighborList |
FastSearchResult.getNeighbors()
Get the k most similar neighbors that we found.
|
NeighborList |
Graph.getNeighbors(T node)
Get the neighborlist of this node.
|
NeighborList |
Graph.put(T node,
NeighborList neighborlist) |
NeighborList |
Graph.search(T query,
int k)
Multi-thread exhaustive search.
|
| Modifier and Type | Method and Description |
|---|---|
Iterable<Map.Entry<T,NeighborList>> |
Graph.entrySet() |
HashMap<T,NeighborList> |
Graph.getHashMap()
Get the underlying hash map that stores the nodes and associated
neighborlists.
|
| Modifier and Type | Method and Description |
|---|---|
int |
NeighborList.countCommonNodes(NeighborList other_nl)
Count the nodes (based on node.id) that are present in both
neighborlists.
|
int |
NeighborList.countCommons(NeighborList other)
Count the number of equivalent neighbors (using similarities).
|
NeighborList |
Graph.put(T node,
NeighborList neighborlist) |
| Constructor and Description |
|---|
NeighborList(NeighborList origin)
Copy constructor.
|
Copyright © 2017. All rights reserved.