| Package | Description |
|---|---|
| org.neolumin.vertexium | |
| org.neolumin.vertexium.path |
| Modifier and Type | Method and Description |
|---|---|
Iterable<Path> |
GraphBase.findPaths(String sourceVertexId,
String destVertexId,
int maxHops,
Authorizations authorizations) |
Iterable<Path> |
Graph.findPaths(String sourceVertexId,
String destVertexId,
int maxHops,
Authorizations authorizations)
Finds all paths between two vertices.
|
Iterable<Path> |
GraphBase.findPaths(String sourceVertexId,
String destVertexId,
int maxHops,
ProgressCallback progressCallback,
Authorizations authorizations) |
Iterable<Path> |
Graph.findPaths(String sourceVertexId,
String destVertexId,
int maxHops,
ProgressCallback progressCallback,
Authorizations authorizations)
Finds all paths between two vertices.
|
Iterable<Path> |
GraphBase.findPaths(Vertex sourceVertex,
Vertex destVertex,
int maxHops,
Authorizations authorizations) |
Iterable<Path> |
Graph.findPaths(Vertex sourceVertex,
Vertex destVertex,
int maxHops,
Authorizations authorizations)
Finds all paths between two vertices.
|
Iterable<Path> |
GraphBase.findPaths(Vertex sourceVertex,
Vertex destVertex,
int maxHops,
ProgressCallback progressCallback,
Authorizations authorizations) |
Iterable<Path> |
Graph.findPaths(Vertex sourceVertex,
Vertex destVertex,
int maxHops,
ProgressCallback progressCallback,
Authorizations authorizations)
Finds all paths between two vertices.
|
| Constructor and Description |
|---|
Path(Path path,
String vertexId) |
| Modifier and Type | Method and Description |
|---|---|
Iterable<Path> |
PathFindingAlgorithm.findPaths(Graph graph,
Vertex sourceVertex,
Vertex destVertex,
int hops,
ProgressCallback progressCallback,
Authorizations authorizations) |
Iterable<Path> |
RecursivePathFindingAlgorithm.findPaths(Graph graph,
Vertex sourceVertex,
Vertex destVertex,
int hops,
ProgressCallback progressCallback,
Authorizations authorizations) |
Copyright © 2014–2015. All rights reserved.