Interface | Description |
---|---|
Dictionary<K,V> |
A Java interface for the Dictionary ADT.
|
Dictionary.Entry<K,V> |
A simple interface for key-value pairs.
|
Graph |
A common Java interface for the Graph ADT, encompassing graphs both
unweighted and weighted, undirected and directed.
|
List<T> |
A Java interface for the List ADT.
|
PriorityPair<T,P extends java.lang.Comparable<? super P>> |
A utility interface for the Heap, Priority Queue, and Updatable Priority
Queue ADTs to work with an item and its priority separately.
|
PriorityQueue<T extends java.lang.Comparable<? super T>> |
A Java interface for the Priority Queue ADT.
|
Queue<T> |
A Java interface for the Queue ADT.
|
Set<T> |
A Java interface for the Set ADT.
|
Stack<T> |
A Java interface for the Stack ADT.
|
UnweightedGraph |
A Java interface for unweighted graphs.
|
UpdatablePriorityQueue<T,P extends java.lang.Comparable<? super P>> |
A Java interface for the Updatable Priority Queue ADT.
|
WeightedGraph |
A Java interface for weighted graphs.
|
Class | Description |
---|---|
DefaultPriorityPairImplementation<T,P extends java.lang.Comparable<? super P>> |
A default implementation of the PriorityPair interface, allowing
priority-based ADTs to work with an item and its priority separately.
|
MysteryDictionaryImplementation<K,V> |
A mysterious implementation of the Dictionary ADT!
|
MysteryListImplementation<T> |
A mysterious implementation of the List ADT!
|
MysteryPriorityQueueImplementation<T extends java.lang.Comparable<? super T>> |
A mysterious implementation of the Priority Queue ADT!
|
MysteryQueueImplementation<T> |
A mysterious implementation of the Queue ADT!
|
MysterySetImplementation<T> |
A mysterious implementation of the Set ADT!
|
MysteryStackImplementation<T> |
A mysterious implementation of the Stack ADT!
|
MysteryUnweightedGraphImplementation |
A mysterious implementation of the Unweighted Graph ADT!
|
MysteryUpdatablePriorityQueueImplementation |
A mysterious implementation of the Updatable Priority Queue ADT!
|
MysteryWeightedGraphImplementation |
A mysterious implementation of the Weighted Graph ADT!
|
Exception | Description |
---|---|
Dictionary.MissingKeyException |
An exception to indicate that a key is not stored in the dictionary.
|
Queue.EmptyQueueException |
An exception to indicate that the queue is empty on dequeue or peek.
|
Stack.EmptyStackException |
An exception to indicate that the stack is empty on pop or peek.
|