|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use DoubleCostAction | |
---|---|
ai.search | |
ai.search.uninformed |
Uses of DoubleCostAction in ai.search |
---|
Subinterfaces of DoubleCostAction in ai.search | |
---|---|
interface |
DoubleCostReversibleAction
Instances implementing this interface represent a reversible action that can be used to transform one search state into another. |
Fields in ai.search declared as DoubleCostAction | |
---|---|
protected DoubleCostAction |
SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn.action
the action that resulted in the state contained in this node |
Methods in ai.search that return DoubleCostAction | |
---|---|
DoubleCostAction |
SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn.getAction()
This function returns the action that leads from the predecessor to the state contained in this node. |
abstract DoubleCostAction[] |
AbstractSearchStateForDoubleCostFn.getAllPossibleActions()
This function returns an array of all the actions that are in principle possible in this state. |
Methods in ai.search that return types with arguments of type DoubleCostAction | |
---|---|
java.lang.Class<? extends DoubleCostAction> |
SearchStateForDoubleCostFn.getActionClass()
This function can be used to retrieve the action class which, together with this state class, defines a search problem. |
java.util.List<inf.util.Pair<DoubleCostAction,S>> |
SearchEngineForDoubleCostFn.getSolutionPath()
This function returns the complete path from the initial state to the goal state found. |
inf.util.Pair<DoubleCostAction,SearchStateForDoubleCostFn> |
AbstractSearchStateForDoubleCostFn.GenericSuccessorIterator.next()
|
java.util.Iterator<inf.util.Pair<DoubleCostAction,SearchStateForDoubleCostFn>> |
SearchStateForDoubleCostFn.successors()
This function indirectly generates the successors for this state in the context of the search problem defined by this class. |
java.util.Iterator<inf.util.Pair<DoubleCostAction,SearchStateForDoubleCostFn>> |
AbstractSearchStateForDoubleCostFn.successors()
This function indirectly generates the successors for this state in the context of the search problem defined by this class. |
Methods in ai.search with parameters of type DoubleCostAction | |
---|---|
void |
SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn.adjustPredecessor(SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S> predecessor,
DoubleCostAction action)
This function can be used to adjust the predecessor for this node. |
SearchStateForDoubleCostFn |
SearchStateForDoubleCostFn.apply(DoubleCostAction action)
This function computes a new search state that is the result of performing the given action in this search state. |
boolean |
SearchStateForDoubleCostFn.isApplicable(DoubleCostAction action)
This function tests whether the given action is applicable in this search state. |
Constructors in ai.search with parameters of type DoubleCostAction | |
---|---|
SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn(S state,
SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S> predecessor,
DoubleCostAction action)
This constructor creates a new search node holding the given state. |
Uses of DoubleCostAction in ai.search.uninformed |
---|
Methods in ai.search.uninformed that return types with arguments of type DoubleCostAction | |
---|---|
java.util.List<inf.util.Pair<DoubleCostAction,S>> |
BidirBFSearcherForDoubleCostFn.getSolutionPath()
This function returns the complete path from the initial state to the goal state found. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |