|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
NODE
- Use amis-path-finding library instead, see svn://artemis.ms.mff.cuni.cz/pogamut/trunk/project/Utils/AmisPathFinding
@Deprecated public 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.
Method Summary | |
---|---|
int |
getExtraCost(NODE nodeFrom,
NODE nodeTo)
Deprecated. Returns extra cost to add to value when trying to go nodeFrom to nodeTo ... of course it can depends only on nodeTo (some special kind of a floor for instance) Don't worry about the edge cost to become negative, A* ensures that that the least cost is 0 (Algorithm can't work over graphs with negative costs.) |
boolean |
isNodeOpened(NODE node)
Deprecated. Returns true if A* can use this node (e.g. to step on this type of floor) You can use it to forbid some specific nodes |
Methods inherited from interface cz.cuni.amis.utils.astar.AStarHeuristic |
---|
getEstimatedDistanceToGoal |
Method Detail |
---|
boolean isNodeOpened(NODE node)
int getExtraCost(NODE nodeFrom, NODE nodeTo)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |