| Modifier and Type | Class and Description |
|---|---|
class |
Graph<V extends SequenceElement,E extends Number>
Graph, where all edges and vertices are stored in-memory.
Internally, this is a directed graph with adjacency list representation; however, if undirected edges are added, these edges are duplicated internally to allow for fast lookup. Depending on the value of allowMultipleEdges, this graph implementation may or may not allow
multiple edges between any two adjacent nodes. |
| Modifier and Type | Method and Description |
|---|---|
IGraph<T,?> |
GraphWalker.getSourceGraph() |
| Modifier and Type | Field and Description |
|---|---|
protected IGraph<V,?> |
NearestVertexWalker.sourceGraph |
protected IGraph<V,?> |
NearestVertexWalker.Builder.sourceGraph |
protected IGraph<T,?> |
RandomWalker.sourceGraph |
protected IGraph<T,?> |
RandomWalker.Builder.sourceGraph |
| Constructor and Description |
|---|
Builder(IGraph<T,?> sourceGraph) |
Builder(IGraph<T,?> graph)
Builder constructor for RandomWalker
|
Builder(IGraph<T,? extends Number> sourceGraph) |
Builder(IGraph<V,?> graph) |
VertexComparator(IGraph<V,E> graph) |
| Modifier and Type | Field and Description |
|---|---|
protected IGraph<T,?> |
GraphTransformer.sourceGraph |
protected IGraph<T,?> |
GraphTransformer.Builder.sourceGraph |
| Constructor and Description |
|---|
Builder(IGraph<T,?> sourceGraph) |
Copyright © 2017. All rights reserved.