Package ai.search.uninformed

Class Summary
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.
BidirBFSearcherForIntCostFn<S extends SearchStateForIntCostFn> 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.
BreadthFirstSearcherForDoubleCostFn<S extends SearchStateForDoubleCostFn> This class represents a search engine that generates a search space in breadth-first order from a given initial state.
BreadthFirstSearcherForIntCostFn<S extends SearchStateForIntCostFn> This class represents a search engine that generates a search space in breadth-first order from a given initial state.
DepthFirstSearcherForDoubleCostFn<S extends SearchStateForDoubleCostFn> This class represents a search engine that generates a search space in depth-first order from a given initial state.
DepthFirstSearcherForIntCostFn<S extends SearchStateForIntCostFn> This class represents a search engine that generates a search space in depth-first order from a given initial state.
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.
IDSearcherForIntCostFn<S extends SearchStateForIntCostFn> This class represents a search engine that traverses a search space by iterative deepening and in depth first order from a given initial state.
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.
UniformCostSearcherForIntCostFn<S extends SearchStateForIntCostFn> This class represents a search engine that generates a search space in ascending order of path cost from a given initial state.