|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
T
- the type of the states used throughout the searchpublic interface BidirectionalProblem<T>
This is the base of all problems which can be solved in the bidirectional search.
Additional to the simple Problem a BidirectionalProblem consists of a methods
to return the goal state and to create predecessor states from a given one.
If you implement this interface, your problem can be solved by the following search algorithms:
public boolean isGoal(T state){
return (goal()==null ? false : goal().equals(state) );
}
BidirectionalSearch
Method Summary | |
---|---|
T |
goal()
Returns the goal state of the search. |
java.util.List<T> |
implode(T state)
Generates all predecessor states of the given state. |
Methods inherited from interface core.Problem |
---|
expand, initial, isGoal |
Method Detail |
---|
T goal()
java.util.List<T> implode(T state)
state
- to be backtracked
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |