Uses of Class
ai.search.SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn

Packages that use SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn

ai.search
ai.search.uninformed

Uses of SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn in ai.search

Fields in ai.search declared as SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn

protected SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>	SearchEngineForDoubleCostFn.foundGoalNode the goal node that has been found or null when no such node has been discovered (yet)
protected SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>	SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn.predecessor the predecessor node of this node

Methods in ai.search that return SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn

SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>

SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn.getPredecessor() This function returns the predecessor node linked to by this node.

Methods in ai.search with parameters of type SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn

void	SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn.adjustPredecessor(SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S> predecessor, DoubleCostAction action) This function can be used to adjust the predecessor for this node.

Constructors in ai.search with parameters of type SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn

SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn(S state, SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S> predecessor, DoubleCostAction action)
This constructor creates a new search node holding the given state.

Uses of SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn in ai.search.uninformed

Fields in ai.search.uninformed with type parameters of type SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn

protected java.util.Map<S,SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	UniformCostSearcherForDoubleCostFn.foundStates the table of all states generated this far for the test for repeated states
protected java.util.Map<S,SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	BreadthFirstSearcherForDoubleCostFn.foundStates the table of all states generated this far for the test for repeated states
protected java.util.Map<S,SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	BidirBFSearcherForDoubleCostFn.foundStatesBwd the table of all states generated this far for the test for repeated states for the backward search
protected java.util.Map<S,SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	BidirBFSearcherForDoubleCostFn.foundStatesFwd the table of all states generated this far for the test for repeated states for the forward search
protected inf.util.DoublePriorityQueue<SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	UniformCostSearcherForDoubleCostFn.searchQueue the search queue for unexplored (open) nodes
protected java.util.List<SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	BreadthFirstSearcherForDoubleCostFn.searchQueue the search queue for explored (closed) and unexplored (open) nodes
protected java.util.List<SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	BidirBFSearcherForDoubleCostFn.searchQueueBwd the search queue for explored (closed) and unexplored (open) nodes for the backward search
protected java.util.List<SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	BidirBFSearcherForDoubleCostFn.searchQueueFwd the search queue for explored (closed) and unexplored (open) nodes for the forward search
protected java.util.List<SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	IDSearcherForDoubleCostFn.searchStack the stack for unexplored (open) nodes
protected java.util.List<SearchEngineForDoubleCostFn.SearchNodeForDoubleCostFn<S>>	DepthFirstSearcherForDoubleCostFn.searchStack the stack for unexplored (open) nodes