| Class | Description |
|---|---|
| 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.
|
| PrintUtilities |
Generic printing utility.
|
| Queue |
A Queue represents a first-in-first-out (FIFO) data structure.
|
| StringComparator |
A Comparator to compare the characters between two String objects.
|
| Exception | Description |
|---|---|
| EmptyQueueException |
Thrown by methods on the Queue class to indicate that the Queue is empty
|
Copyright © 2019 JULIE Lab, Germany. All rights reserved.