Package <Unnamed>

Interface Summary

Dictionary<K,V>	An interface for the Dictionary ADT.
DictPair<K,V>	A simple interface for key-value pairs.
DisjointSets	Java interface for the Disjoint-Sets ADT (also known as a "union-find" data structure).
Graph	A common interface for the Graph ADT, encompassing graphs both unweighted and weighted, undirected and directed.
Heap<T extends Comparable<? super T>>	An interface for the Max-Heap ADT.
List<T>	An interface for the List ADT.
PriorityPair<T,P extends Comparable<? super P>>	A utility interface for the Updatable Priority Queue ADT to work with an item and its priority simultaneously.
PriorityQueue<T extends Comparable<? super T>>	An interface for the Priority Queue ADT.
Queue<T>	An interface for the Queue ADT.
SearchTree<T extends Comparable<? super T>>	Interface for the Search Tree ADT.
Set<T>	An ADT that represents a set: a bunch of items that must be distinct from each other, stored with no defined order.
Stack<T>	An interface for the Stack ADT.
UnweightedGraph	An interface for unweighted graphs.
UpdatablePriorityQueue<T,P extends Comparable<? super P>>	An interface for the Updatable Priority Queue ADT, which allows the user to query and change the priority of items in the queue.
WeightedGraph	An interface for weighted graphs.

Class Summary

MysteryDisjointSetsImplementation	A mysterious implementation of the Disjoin-Sets ADT!
MysteryListImplementation<T>	An implementation of the List ADT.
MysteryQueueImplementation<T>	An implementation of the Queue ADT.
MysteryStackImplementation<T>	An implementation of the Stack ADT.
MysteryUnweightedGraphImplementation	An implementation of the Unweighted Graph ADT.
MysteryWeightedGraphImplementation	An implementation of the Weighted Graph ADT.