Package salvo.jesus.util

Class Summary
Collections  
Heap The Heap class implements a heap data structure, also called a priority queue.
HeapNode A node in a Heap, encapsulating the actual object represented by the noode plus the priority of the node in the heap.
HeapNodeComparator A Comparator to compare HeapNodes based on their priority.
Queue A Queue represents a first-in-first-out (FIFO) data structure.
 

Exception Summary
EmptyQueueException Thrown by methods on the Queue class to indicate that the Queue is empty