Class PriorityQueue

An unbounded priority queue based on a priority heap.

The elements of the priority queue are ordered according to their natural ordering, or by a Comparator provided at queue construction time, depending on which constructor is used

A priority queue does not permit null elements

A priority queue relying on natural ordering also does not permit insertion of non-comparable objects

Constructors and Important Methods

Constructors:

/*
Parameters:

initialCapacity - the initial capacity for this priority queue

comparator - the comparator that will be used to order this priority queue. 
If null, the natural ordering of the elements will be used.
*/
public PriorityQueue(int initialCapacity,
             Comparator<? super E> comparator)

Methods: