public interface IPathFinder
Modifier and Type | Method and Description |
---|---|
java.util.Optional<IPath> |
bestPathSoFar()
The best path so far, according to the most forgiving coefficient heuristic (the reason being that that path is
most likely to represent the true shape of the path to the goal, assuming it's within a possible cost heuristic.
|
PathCalculationResult |
calculate(long primaryTimeout,
long failureTimeout)
Calculate the path in full.
|
Goal |
getGoal() |
boolean |
isFinished()
Intended to be called concurrently with calculatePath from a different thread to tell if it's finished yet
|
java.util.Optional<IPath> |
pathToMostRecentNodeConsidered()
Called for path rendering.
|
PathCalculationResult calculate(long primaryTimeout, long failureTimeout)
primaryTimeout
- If a path is found, the path finder will stop after this amount of timefailureTimeout
- If a path isn't found, the path finder will continue for this amount of timeboolean isFinished()
java.util.Optional<IPath> pathToMostRecentNodeConsidered()
java.util.Optional<IPath> bestPathSoFar()