public Queue<SearchNode<O, T>> createQueue()
    {
        return new PriorityQueue<SearchNode<O, T>>(11, new UniformCostComparator());
    }
public Queue<SearchNode<O, T>> createQueue()
    {
        return new PriorityQueue<SearchNode<O, T>>(11, new UniformCostComparator());
    }
public Queue < SearchNode < O , T > > createQueue ( ) { return new PriorityQueue < SearchNode < O , T > > ( 11 , new UniformCostComparator ( ) ) ; }
Creates the correct type of queue for this search. This search uses a priority queue ordered by path cost.

@return An empty priority queue with path cost.
Creates the correct type of queue for this search . This search uses a priority queue ordered by path cost .