Package scranton.queue

Contains the Queue interface and several static and recursive implementations of the Queue interface.

See:
Description

Interface Summary

PriorityQueue	A priority queue applies a comparator so that the remove method dispenses the object that preceed the other objects in the queue when odered with the comparator.
Queue	Specifications for a queue, the semi-formal notation for specifications appears on the notation page.

Class Summary

PriorityQueueViaHeapArray	PriorityQueueViaHeap Class applies a heap to implement a priority queue.
QueueViaArrayCirc	Implements the Queue interface via compositon using an array (wraparound).
QueueViaLinear1Circ	Implements the Queue interface via composition of the Linear1 class, which is used to represent the array as a circularly linked structure.

Package scranton.queue Description

Contains the Queue interface and several static and recursive implementations of the Queue interface.