|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface SearchStrategy<K extends AgentAction,S extends AgentState>
An strategy for maintaining a search fringe.
A search strategy can be defined by the type of fringe it maintains.
A fringe can be considered a simple data structure such as a queue; it must simply support #insert, #empty, and #removeFirst actions.
Popular fringe data structures, and the search strategies they implement, include:
Method Summary | |
---|---|
void |
insert(SearchNode<K,S> newNode)
Inserts a new node into the fringe. |
boolean |
isEmpty()
Indicates whether the fringe is currently empty. |
SearchNode<K,S> |
removeFirst()
Returns the next node to be expanded from the fringe. |
Method Detail |
---|
void insert(SearchNode<K,S> newNode)
newNode
- boolean isEmpty()
SearchNode<K,S> removeFirst()
Obviously, the interesting differences between fringe implementations rely on this method's behavior.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |