Package m865.datastructures

Interface Summary
Prioritizeable This interface defines the key method required for an object to be Prioritizeable.
 

Class Summary
AbstractPriorityQueue Abstract class for the priority queue data structure.
AbstractQueue<T> Abstract class for the queue data structure.
AbstractStack<T> Abstract class for the stack data structure.
PrioritizedItem The PrioritizedItem class contains objects which consist of a comparable object which represents the explicit priority, and a general object which is the prioritized datum.
PriorityQueueAL This class implements a Queue using a dynamic array Version 2.1 incorporated a new class roster.
QueueCL<T> This class implements a Queue using a circular list embedded in a dynamic array Version 3.0 incorporates generics
QueueLL<T> This class implements a Queue using a simple Linked List.
StackAL<T> This class implements a Stack using a dynamic array Version 3.0 incorporates generics
StackLL<T> This class implements a Stack using a simple Linked List.