|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface SearchNode<K extends AgentAction,S extends AgentState>
A bookkeeping data structure used to represent the search tree.
Note that nodes are on particular paths, while states are not.
Also, two different nodes can contain the same world state, if that state is generated via two different search paths.
Method Summary | |
---|---|
K |
getAction()
Gets the action that was applied to the parent to generate this node. |
int |
getDepth()
Returns the number of steps along the path from the initial node to this one. |
SearchNode<K,S> |
getParentNode()
Gets the node in the search tree that generated this node. |
double |
getPathCost()
Returns the cost, aka g(n), of the path from the initial state to this node. |
S |
getState()
Gets the state in the state space to which the node corresponds. |
Method Detail |
---|
S getState()
SearchNode<K,S> getParentNode()
K getAction()
double getPathCost()
int getDepth()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |