|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
P - the path type that the algorithm producespublic interface PathFinder<P extends Path>
Interface of algorithms that finds paths in between two nodes.
| Method Summary | |
|---|---|
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. |
| Method Detail |
|---|
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.
start - the start Node which defines the start of the path.end - the end Node which defines the end of the path.
Path between start and end,
or null if no path was found.
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.
start - the start Node which defines the start of the path.end - the end Node which defines the end of the path.
Paths between start and end.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||