See Also: PriorityQueue Members
A PriorityQueue holds elements on a priority heap, which orders the elements according to their natural order or according to the comparator specified at construction time. If the queue uses natural ordering, only elements that are comparable are permitted to be inserted into the queue.
The least element of the specified ordering is the first retrieved with PriorityQueue.Poll and the greatest element is the last.
A PriorityQueue is not synchronized. If multiple threads will have to access it concurrently, use the Java.Util.Concurrent.PriorityBlockingQueue.