cz.cuni.amis.utils.astar
Interface AStarMap<NODE>

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)

Method Summary

int	getEdgeCost(NODE nodeFrom, NODE nodeTo) Should return the distance from nodeFrom to nodeTo You can be sure that nodeTo is among the neighbours of nodeFrom.
int	getNodeCost(NODE node) General cost of having this node at your path.
Collection<NODE>	getNodeNeighbours(NODE node) This should return a collection of nodes which are connected to this one.

Method Detail

getNodeCost

int getNodeCost(NODE node)

General cost of having this node at your path. This allows you to say how every node appeals to the agent, it may specify "this is a cool node, try to get it on your path" (negative cost) or "this is neutral node" (zero cost) or "this is a bad node to have on your path" (positive cost).

Parameters:

node -

Returns:

getEdgeCost

int getEdgeCost(NODE nodeFrom,
                NODE nodeTo)

Should return the distance from nodeFrom to nodeTo You can be sure that nodeTo is among the neighbours of nodeFrom.

Parameters:

nodeFrom -

nodeTo -

Returns:

cost of an edge

getNodeNeighbours

Collection<NODE> getNodeNeighbours(NODE node)

This should return a collection of nodes which are connected to this one.