Uses of Interface
ai.search.SearchStateForDoubleCostFn

Packages that use SearchStateForDoubleCostFn

ai.search
ai.search.uninformed

Uses of SearchStateForDoubleCostFn in ai.search

Classes in ai.search with type parameters of type SearchStateForDoubleCostFn

class	SearchEngineForDoubleCostFn<S extends SearchStateForDoubleCostFn> This class is a generic AI search engine that traverses a search space defined by an initial search state and a set of available actions.
protected static class	SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S extends SearchStateForDoubleCostFn> A search node is a data structure created by a search engine to keep track of the portion of the search space explored so far.

Classes in ai.search that implement SearchStateForDoubleCostFn

class

AbstractSearchStateForDoubleCostFn This class represents a state of the world in a search problem.

Fields in ai.search declared as SearchStateForDoubleCostFn

protected S	SearchEngineForDoubleCostFn.initialState the initial state for the search; this value must be set by the constructor
protected S	SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn.state the search state contained in this node

Methods in ai.search that return SearchStateForDoubleCostFn

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.

Methods in ai.search that return types with arguments of type SearchStateForDoubleCostFn

java.lang.Class<? extends SearchStateForDoubleCostFn>	DoubleCostAction.getStateClass() This function can be used to retrieve the state class which, together with this action class, defines a search problem.
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 SearchStateForDoubleCostFn

double

DoubleCostAction.getCost(SearchStateForDoubleCostFn state) This function returns the cost of applying this action in the given search state.

Uses of SearchStateForDoubleCostFn in ai.search.uninformed

Classes in ai.search.uninformed with type parameters of type SearchStateForDoubleCostFn

class	BidirBFSearcherForDoubleCostFn<S extends SearchStateForDoubleCostFn> This class represents a search engine that traverses a search space bi-directionally in breadth first order from a given initial state and a given goal state.
class	BreadthFirstSearcherForDoubleCostFn<S extends SearchStateForDoubleCostFn> This class represents a search engine that generates a search space in breadth-first order from a given initial state.
class	DepthFirstSearcherForDoubleCostFn<S extends SearchStateForDoubleCostFn> This class represents a search engine that generates a search space in depth-first order from a given initial state.
class	IDSearcherForDoubleCostFn<S extends SearchStateForDoubleCostFn> This class represents a search engine that traverses a search space by iterative deepening and in depth first order from a given initial state.
class	UniformCostSearcherForDoubleCostFn<S extends SearchStateForDoubleCostFn> This class represents a search engine that generates a search space in ascending order of path cost from a given initial state.

Fields in ai.search.uninformed declared as SearchStateForDoubleCostFn

protected S

BidirBFSearcherForDoubleCostFn.goalState the goal state from which the backward search starts