|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||

@Deprecated public interface AStarMap<NODE>
This class represents the search space for A* algorithm 1) we need to know which neighbours the node has 2) we need to know the travel cost between two nodes (edge cost)
Use amis-path-finding library instead, see svn://artemis.ms.mff.cuni.cz/pogamut/trunk/project/Utils/AmisPathFinding
| Method Summary | |
|---|---|
int |
getEdgeCost(NODE nodeFrom,
NODE nodeTo)
Deprecated. Should return the distance from nodeFrom to nodeTo You can be sure that nodeTo is among the neighbours of nodeFrom. |
int |
getNodeCost(NODE node)
Deprecated. General cost of having this node at your path. |
Collection<NODE> |
getNodeNeighbours(NODE node)
Deprecated. This should return a collection of nodes which are connected to this one. |
| Method Detail |
|---|
int getNodeCost(NODE node)
node -
int getEdgeCost(NODE nodeFrom,
NODE nodeTo)
nodeFrom - nodeTo -
Collection<NODE> getNodeNeighbours(NODE node)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||