|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use AStarHeuristic | |
|---|---|
| cz.cuni.amis.utils.astar | |
| Uses of AStarHeuristic in cz.cuni.amis.utils.astar |
|---|
| Subinterfaces of AStarHeuristic in cz.cuni.amis.utils.astar | |
|---|---|
interface |
AStarEvaluator<NODE>
Evaluator is extending a functionality of AStarHeuristic allowing
you to additionally specified which NODEs can't be visited at all or assign
extra cost to edges between nodes which is added to AStarMap.getEdgeCost(Object, Object)
when computing distances between them. |
interface |
AStarGoal<NODE>
This class defines the goal of A* algorithm, it allows you to provide complex implementation of the AStarGoal.isGoalReached(Object) method. |
| Methods in cz.cuni.amis.utils.astar with parameters of type AStarHeuristic | ||
|---|---|---|
static
|
AStar.aStar(AStarMap<NODE> map,
AStarHeuristic<NODE> heuristic,
NODE start,
NODE goal)
Method performing an AStar search over graph defined inside AStarMap starting from 'start' node driving
itself towards 'goal' using heuristic defined by AStarHeuristic. |
|
static
|
AStar.aStar(AStarMap<NODE> map,
AStarHeuristic<NODE> heuristic,
NODE start,
NODE goal,
int maxIterations)
Method performing an AStar search over graph defined inside AStarMap starting from 'start' node driving
itself towards 'goal' using heuristic defined by AStarHeuristic. |
|
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||