Package search

Class AStarFrontierSearcher.SimpleNodes<State,​Frontier extends Frontiers.PriorityQueue<Nodes.SimpleTreeCostNode<State>>>

java.lang.Object
search.GraphSearcher<State,​Node,​Frontier>
search.PriorityQueueSearcher<State,​Node,​Frontier>
search.AStarFrontierSearcher<State,​Nodes.SimpleTreeCostNode<State>,​Frontier>
search.AStarFrontierSearcher.SimpleNodes<State,​Frontier>
Type Parameters:
State - Type representing elements of the search space.
Frontier - Type representing the (entire) search frontier (open set).
Enclosing class:
AStarFrontierSearcher<State,​Node extends SearchTreeNode<Node,​State> & KnowsOwnCost,​Frontier extends Frontiers.PriorityQueue<Node>>

public static class AStarFrontierSearcher.SimpleNodes<State,​Frontier extends Frontiers.PriorityQueue<Nodes.SimpleTreeCostNode<State>>>
extends AStarFrontierSearcher<State,​Nodes.SimpleTreeCostNode<State>,​Frontier>
A specialization of AStarFrontierSearcher to use a minimal implementation of unrelated search tree nodes (with a state and accumulated cost only), with the frontier implementation still exposed as a type parameter.