Package | Description |
---|---|
cz.cuni.amis.utils.astar |
Modifier and Type | Interface and Description |
---|---|
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. |
Modifier and Type | Method and Description |
---|---|
static <NODE> AStarResult<NODE> |
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 <NODE> AStarResult<NODE> |
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 . |
Copyright © 2012 AMIS research group, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic. All Rights Reserved.