P - the path type that the algorithm producespublic interface PathFinder<P extends Path>
| Modifier and Type | Method and Description |
|---|---|
Iterable<P> |
findAllPaths(Node start,
Node end)
Tries to find all paths between
start and end nodes. |
P |
findSinglePath(Node start,
Node end)
Tries to find a single path between
start and end
nodes. |
TraversalMetadata |
metadata() |
P findSinglePath(Node start, Node end)
start and end
nodes. If a path is found a Path is returned with that path
information, else null is returned. If more than one path is
found, the implementation can decide itself upon which of those to return.Iterable<P> findAllPaths(Node start, Node end)
start and end nodes.
A collection of Paths is returned with all the found paths.
If no paths are found an empty collection is returned.TraversalMetadata metadata()
Copyright © 2002–2015 The Neo4j Graph Database Project. All rights reserved.