Uses of Class
ai.search.SearchEngineForIntCostFn.SearchNodeForIntCostFn

Packages that use SearchEngineForIntCostFn.SearchNodeForIntCostFn

ai.search
ai.search.informed
ai.search.uninformed

Uses of SearchEngineForIntCostFn.SearchNodeForIntCostFn in ai.search

Fields in ai.search declared as SearchEngineForIntCostFn.SearchNodeForIntCostFn

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

Methods in ai.search that return SearchEngineForIntCostFn.SearchNodeForIntCostFn

SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>

SearchEngineForIntCostFn.SearchNodeForIntCostFn.getPredecessor() This function returns the predecessor node linked to by this node.

Methods in ai.search with parameters of type SearchEngineForIntCostFn.SearchNodeForIntCostFn

void	SearchEngineForIntCostFn.SearchNodeForIntCostFn.adjustPredecessor(SearchEngineForIntCostFn.SearchNodeForIntCostFn<S> predecessor, IntCostAction action) This function can be used to adjust the predecessor for this node.

Constructors in ai.search with parameters of type SearchEngineForIntCostFn.SearchNodeForIntCostFn

SearchEngineForIntCostFn.SearchNodeForIntCostFn(S state, SearchEngineForIntCostFn.SearchNodeForIntCostFn<S> predecessor, IntCostAction action)
This constructor creates a new search node holding the given state.

Uses of SearchEngineForIntCostFn.SearchNodeForIntCostFn in ai.search.informed

Subclasses of SearchEngineForIntCostFn.SearchNodeForIntCostFn in ai.search.informed

protected class

MAStarSearcherForIntCostFn.MbSearchNode

Fields in ai.search.informed declared as SearchEngineForIntCostFn.SearchNodeForIntCostFn

protected SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>[]

RBFSearcherForIntCostFn.searchStack the stack for unexplored (open) nodes

Fields in ai.search.informed with type parameters of type SearchEngineForIntCostFn.SearchNodeForIntCostFn

protected java.util.Map<S,SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	RandomizedAStarSearcherForIntCostFn.foundStates the table of all states generated this far for the test for repeated states
protected java.util.Map<S,SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	GreedySearcherForIntCostFn.foundStates the table of all states generated this far for the test for repeated states
protected java.util.Map<S,SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	AStarSearcherForIntCostFn.foundStates the table of all states generated this far for the test for repeated states
protected inf.util.RandomAccessIntPriorityQueue<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	RandomizedAStarSearcherForIntCostFn.searchQueue the search queue for unexplored (open) nodes
protected inf.util.IntPriorityQueue<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	GreedySearcherForIntCostFn.searchQueue the search queue for unexplored (open) nodes
protected inf.util.IntPriorityQueue<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	AStarSearcherForIntCostFn.searchQueue the search queue for unexplored (open) nodes
protected java.util.List<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	IDAStarSearcherForIntCostFn.searchStack the stack for unexplored (open) nodes

Uses of SearchEngineForIntCostFn.SearchNodeForIntCostFn in ai.search.uninformed

Fields in ai.search.uninformed with type parameters of type SearchEngineForIntCostFn.SearchNodeForIntCostFn

protected java.util.Map<S,SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	UniformCostSearcherForIntCostFn.foundStates the table of all states generated this far for the test for repeated states
protected java.util.Map<S,SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	BreadthFirstSearcherForIntCostFn.foundStates the table of all states generated this far for the test for repeated states
protected java.util.Map<S,SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	BidirBFSearcherForIntCostFn.foundStatesBwd the table of all states generated this far for the test for repeated states for the backward search
protected java.util.Map<S,SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	BidirBFSearcherForIntCostFn.foundStatesFwd the table of all states generated this far for the test for repeated states for the forward search
protected inf.util.IntPriorityQueue<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	UniformCostSearcherForIntCostFn.searchQueue the search queue for unexplored (open) nodes
protected java.util.List<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	BreadthFirstSearcherForIntCostFn.searchQueue the search queue for explored (closed) and unexplored (open) nodes
protected java.util.List<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	BidirBFSearcherForIntCostFn.searchQueueBwd the search queue for explored (closed) and unexplored (open) nodes for the backward search
protected java.util.List<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	BidirBFSearcherForIntCostFn.searchQueueFwd the search queue for explored (closed) and unexplored (open) nodes for the forward search
protected java.util.List<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	IDSearcherForIntCostFn.searchStack the stack for unexplored (open) nodes
protected java.util.List<SearchEngineForIntCostFn.SearchNodeForIntCostFn<S>>	DepthFirstSearcherForIntCostFn.searchStack the stack for unexplored (open) nodes