/** * Creates the correct type of search nodes for this search. This search uses ordinary search nodes. * * @param state The search space state to create a search node for. * * @return The state encapsulated in an ordinary search node. */ public SearchNode<O, T> createSearchNode(T state) { return new SearchNode<O, T>(state); }
/** * Creates the correct type of search nodes for this search. This search uses ordinary search nodes. * * @param state The search space state to create a search node for. * * @return The state encapsulated in an ordinary search node. */ public SearchNode<O, T> createSearchNode(T state) { return new SearchNode<O, T>(state); }
/** * This abstract method should be overriden to turn states into search nodes. Different implementation of queue * based algorithms can control the way they search by using different search node implementations. This method * allows the type of search node to be abstracted out of this search method to be supplied by concrete * implementations. * * @param state The state to create a {@link SearchNode} from. * * @return The {@link SearchNode} for the specified state. */ public SearchNode<O, T> createSearchNode(T state) { return new SearchNode<O, T>(state); }
/** * Creates the correct type of search nodes for this search. This search uses ordinary search nodes. * * @param state The search space state to create a search node for. * * @return The state encapsulated in a search node. */ public SearchNode createSearchNode(T state) { return new SearchNode(state); }
/** * Creates the correct type of search nodes for this search. This search uses ordinary search nodes. * * @param state The search space state to create a search node for. * * @return The state encapsulated in a search node. */ public SearchNode createSearchNode(T state) { return new SearchNode(state); }
/** * Creates the correct type of search nodes for this search. This search uses ordinary search nodes. * * @param state The search space state to create a search node for. * * @return The state encapsulated in a search node. */ public SearchNode createSearchNode(T state) { return new SearchNode(state); }
/** * Creates the correct type of search nodes for this search. This search uses ordinary search nodes. * * @param state The search space state to create a search node for. * * @return The state encapsulated in a search node. */ public SearchNode createSearchNode(T state) { return new SearchNode(state); }
/** * This abstract method should be overriden to turn states into search nodes. Different implementation of queue * based algorithms can control the way they search by using different search node implementations. This method * allows the type of search node to be abstracted out of this search method to be supplied by concrete * implementations. * * @param state The state to create a {@link SearchNode} from. * * @return The {@link SearchNode} for the specified state. */ public SearchNode<O, T> createSearchNode(T state) { return new SearchNode<O, T>(state); }