public Queue<SearchNode<O, T>> createQueue()
    {
        return new PriorityQueue<SearchNode<O, T>>(11, new AStarComparator());
    }
public Queue<SearchNode<O, T>> createQueue()
    {
        return new PriorityQueue<SearchNode<O, T>>(11, new AStarComparator());
    }
public Queue < SearchNode < O , T > > createQueue ( ) { return new PriorityQueue < SearchNode < O , T > > ( 11 , new AStarComparator ( ) ) ; }
Creates a priority queue with an {@link AStarComparator} to control the search ordering of the basic queue search
algorithm.

@return The A* priority queue.
Creates a priority queue with an { @link AStarComparator } to control the search ordering of the basic queue search algorithm .