Uses of Interface
inf.util.PriorityQueue

Uses of PriorityQueue in inf.util
 

Subinterfaces of PriorityQueue in inf.util
 interface DoublePriorityQueue<E>
           This class represents a priority queue, that is a queue in which elements can be held and from which they can be retrieved by priority.
 interface IntPriorityQueue<E>
           This class represents a priority queue, that is a queue in which elements can be held and from which they can be retrieved by priority.
 

Classes in inf.util that implement PriorityQueue
 class ArrayOfHashedListsIntPriorityQueue<E>
           This class represents a priority queue, that is a queue in which elements can be held and from which they can be retrieved by priority.
 class ArrayOfListsIntPriorityQueue<E>
           This class represents a priority queue, that is a queue in which elements can be held and from which they can be retrieved by priority.
 class RandomAccessIntPriorityQueue<E>
           This class represents a priority queue, that is a queue in which elements can be held and from which they can be retrieved by priority.
 class TreeOfListsDoublePriorityQueue<E>
           This class represents a priority queue, that is a queue in which elements can be held and from which they can be retrieved by priority.