A C D E G H I K L M N P Q R S T U V W

A

add(K, V) - Method in interface Dictionary

Sets the value associated with a given key.

add(T) - Method in interface List

Adds newItem to the end of the list.

add(int, T) - Method in interface List

Adds newItem at the given index.

add(K, V) - Method in class MysteryDictionaryImplementation

add(T) - Method in class MysteryListImplementation

add(int, T) - Method in class MysteryListImplementation

add(T) - Method in class MysteryPriorityQueueImplementation

add(T) - Method in class MysterySetImplementation

add(PriorityPair<Integer, Double>) - Method in class MysteryUpdatablePriorityQueueImplementation

add(Integer, Double) - Method in class MysteryUpdatablePriorityQueueImplementation

add(T) - Method in interface PriorityQueue

Adds an item to the queue.

add(T) - Method in interface Set

Adds the given item to the set, ignoring duplicates.

add(PriorityPair<T, P>) - Method in interface UpdatablePriorityQueue

Adds an item, with the priority given in the pair, to the queue.

add(T, P) - Method in interface UpdatablePriorityQueue

Adds an item, with the given priority, to the queue.

addEdge(int, int) - Method in class MysteryUnweightedGraphImplementation

addEdge(int, int, double) - Method in class MysteryWeightedGraphImplementation

addEdge(int, int) - Method in interface UnweightedGraph

Adds an unweighted edge between two vertices.

addEdge(int, int, double) - Method in interface WeightedGraph

Adds a weighted edge between two vertices.

addVertex() - Method in interface Graph

Adds a new vertex.

addVertex() - Method in class MysteryUnweightedGraphImplementation

addVertex() - Method in class MysteryWeightedGraphImplementation

at(int) - Method in interface List

Returns the item at a given index.

at(int) - Method in class MysteryListImplementation

C

clear() - Method in interface Dictionary

Removes all entries from this dictionary.

clear() - Method in interface Graph

Removes all vertices and edges from the graph.

clear() - Method in interface List

Removes all items from the list.

clear() - Method in class MysteryDictionaryImplementation

clear() - Method in class MysteryListImplementation

clear() - Method in class MysteryPriorityQueueImplementation

clear() - Method in class MysteryQueueImplementation

clear() - Method in class MysterySetImplementation

clear() - Method in class MysteryStackImplementation

clear() - Method in class MysteryUnweightedGraphImplementation

clear() - Method in class MysteryUpdatablePriorityQueueImplementation

clear() - Method in class MysteryWeightedGraphImplementation

clear() - Method in interface PriorityQueue

Removes all items from the queue.

clear() - Method in interface Queue

Removes all items from the queue.

clear() - Method in interface Set

Removes all items from the set.

clear() - Method in interface Stack

Removes all items from the stack.

compareTo(PriorityPair<T, P>) - Method in class DefaultPriorityPairImplementation

contains(K) - Method in interface Dictionary

Returns whether a specific key is in this dictionary.

contains(T) - Method in interface List

Returns true if the list contains the target item.

contains(K) - Method in class MysteryDictionaryImplementation

contains(T) - Method in class MysteryListImplementation

contains(T) - Method in class MysterySetImplementation

contains(T) - Method in interface Set

Returns whether the given item is in the set.

D

DefaultPriorityPairImplementation<T,P extends java.lang.Comparable<? super P>> - Class in <Unnamed>

A default implementation of the PriorityPair interface, allowing priority-based ADTs to work with an item and its priority separately.

DefaultPriorityPairImplementation(T, P) - Constructor for class DefaultPriorityPairImplementation

dequeue() - Method in class MysteryQueueImplementation

dequeue() - Method in interface Queue

Removes an item from the front of the queue and returns it.

Dictionary<K,V> - Interface in <Unnamed>

A Java interface for the Dictionary ADT.

Dictionary.Entry<K,V> - Interface in <Unnamed>

A simple interface for key-value pairs.

Dictionary.MissingKeyException - Exception in <Unnamed>

An exception to indicate that a key is not stored in the dictionary.

E

EmptyQueueException() - Constructor for exception Queue.EmptyQueueException

EmptyStackException() - Constructor for exception Stack.EmptyStackException

enqueue(T) - Method in class MysteryQueueImplementation

enqueue(T) - Method in interface Queue

Adds the given item to the back of the queue.

equals(Object) - Method in class MysteryListImplementation

G

getDegree(int) - Method in interface Graph

Returns the out-degree of the specified vertex.

getDegree(int) - Method in class MysteryUnweightedGraphImplementation

getDegree(int) - Method in class MysteryWeightedGraphImplementation

getInDegree(int) - Method in interface Graph

Returns the in-degree of the specified vertex.

getInDegree(int) - Method in class MysteryUnweightedGraphImplementation

getInDegree(int) - Method in class MysteryWeightedGraphImplementation

getNeighbors(int) - Method in interface Graph

Returns an iterable object that allows iteration over the neighbors of the specified vertex.

getNeighbors(int) - Method in class MysteryUnweightedGraphImplementation

getNeighbors(int) - Method in class MysteryWeightedGraphImplementation

getPriority(Integer) - Method in class MysteryUpdatablePriorityQueueImplementation

getPriority(T) - Method in interface UpdatablePriorityQueue

Returns the priority of the given item, or, if that item is not in the queue, an implementation-specific sentinel value.

getValue(K) - Method in interface Dictionary

Returns the value associated with a given key.

getValue(K) - Method in class MysteryDictionaryImplementation

getWeight(int, int) - Method in class MysteryWeightedGraphImplementation

getWeight(int, int) - Method in interface WeightedGraph

Gets the weight of the edge between two vertices.

Graph - Interface in <Unnamed>

A common Java interface for the Graph ADT, encompassing graphs both unweighted and weighted, undirected and directed.

H

hasEdge(int, int) - Method in interface Graph

Returns whether an edge exists between two vertices.

hasEdge(int, int) - Method in class MysteryUnweightedGraphImplementation

hasEdge(int, int) - Method in class MysteryWeightedGraphImplementation

hashCode() - Method in class MysteryListImplementation

I

isDirected() - Method in interface Graph

Returns true if the graph is directed.

isDirected() - Method in class MysteryUnweightedGraphImplementation

isDirected() - Method in class MysteryWeightedGraphImplementation

isEmpty() - Method in interface Dictionary

Returns true if this dictionary is empty.

isEmpty() - Method in interface Graph

Returns true if there are no vertices in the graph.

isEmpty() - Method in interface List

Returns true if the list is empty.

isEmpty() - Method in class MysteryDictionaryImplementation

isEmpty() - Method in class MysteryListImplementation

isEmpty() - Method in class MysteryPriorityQueueImplementation

isEmpty() - Method in class MysteryQueueImplementation

isEmpty() - Method in class MysterySetImplementation

isEmpty() - Method in class MysteryStackImplementation

isEmpty() - Method in class MysteryUnweightedGraphImplementation

isEmpty() - Method in class MysteryUpdatablePriorityQueueImplementation

isEmpty() - Method in class MysteryWeightedGraphImplementation

isEmpty() - Method in interface PriorityQueue

Returns true if the queue is empty.

isEmpty() - Method in interface Queue

Returns true if the queue is empty.

isEmpty() - Method in interface Set

Returns true if the set is empty.

isEmpty() - Method in interface Stack

Returns true if the stack is empty.

item() - Method in class DefaultPriorityPairImplementation

item() - Method in interface PriorityPair

iterator() - Method in interface Dictionary

Returns an iterator over the key-value pairs in the dictionary.

iterator() - Method in interface List

Returns an iterator that begins just before index 0 in this list.

iterator() - Method in class MysteryDictionaryImplementation

iterator() - Method in class MysteryListImplementation

iterator() - Method in class MysterySetImplementation

iterator() - Method in interface Set

Returns an iterator over the items in the set (which will access the items in some arbitrary order).

K

key() - Method in interface Dictionary.Entry

L

length() - Method in interface List

Returns the length of the list.

length() - Method in class MysteryListImplementation

List<T> - Interface in <Unnamed>

A Java interface for the List ADT.

M

missingEdgeSentinel() - Method in class MysteryWeightedGraphImplementation

missingEdgeSentinel() - Method in interface WeightedGraph

Returns the "sentinel" weight value for edges not in the graph.

MissingKeyException() - Constructor for exception Dictionary.MissingKeyException

MissingKeyException(String) - Constructor for exception Dictionary.MissingKeyException

MysteryDictionaryImplementation<K,V> - Class in <Unnamed>

A mysterious implementation of the Dictionary ADT!

MysteryDictionaryImplementation() - Constructor for class MysteryDictionaryImplementation

MysteryListImplementation<T> - Class in <Unnamed>

A mysterious implementation of the List ADT!

MysteryListImplementation() - Constructor for class MysteryListImplementation

Constructs an empty list.

MysteryPriorityQueueImplementation<T extends java.lang.Comparable<? super T>> - Class in <Unnamed>

A mysterious implementation of the Priority Queue ADT!

MysteryPriorityQueueImplementation() - Constructor for class MysteryPriorityQueueImplementation

Constructs an empty priority queue.

MysteryQueueImplementation<T> - Class in <Unnamed>

A mysterious implementation of the Queue ADT!

MysteryQueueImplementation() - Constructor for class MysteryQueueImplementation

Constructs an empty queue.

MysterySetImplementation<T> - Class in <Unnamed>

A mysterious implementation of the Set ADT!

MysterySetImplementation() - Constructor for class MysterySetImplementation

MysteryStackImplementation<T> - Class in <Unnamed>

A mysterious implementation of the Stack ADT!

MysteryStackImplementation() - Constructor for class MysteryStackImplementation

Constructs an empty stack.

MysteryUnweightedGraphImplementation - Class in <Unnamed>

A mysterious implementation of the Unweighted Graph ADT!

MysteryUnweightedGraphImplementation() - Constructor for class MysteryUnweightedGraphImplementation

Default constructor: an empty directed graph.

MysteryUnweightedGraphImplementation(boolean) - Constructor for class MysteryUnweightedGraphImplementation

Constructs an empty graph with the specified directedness.

MysteryUnweightedGraphImplementation(boolean, int) - Constructor for class MysteryUnweightedGraphImplementation

Constructs a graph with N vertices and the specified directedness.

MysteryUpdatablePriorityQueueImplementation - Class in <Unnamed>

A mysterious implementation of the Updatable Priority Queue ADT!

MysteryUpdatablePriorityQueueImplementation(int) - Constructor for class MysteryUpdatablePriorityQueueImplementation

Constructs a queue, given the maximum item value that the queue shall be able to store.

MysteryWeightedGraphImplementation - Class in <Unnamed>

A mysterious implementation of the Weighted Graph ADT!

MysteryWeightedGraphImplementation() - Constructor for class MysteryWeightedGraphImplementation

Default constructor: an empty directed graph.

MysteryWeightedGraphImplementation(boolean) - Constructor for class MysteryWeightedGraphImplementation

Constructs an empty graph with the specified directedness, with a sentinel value of Double.POSITIVE_INFINITY.

MysteryWeightedGraphImplementation(boolean, int) - Constructor for class MysteryWeightedGraphImplementation

Constructs a graph with N vertices and the specified directedness, with a sentinel value of Double.POSITIVE_INFINITY.

MysteryWeightedGraphImplementation(boolean, int, double) - Constructor for class MysteryWeightedGraphImplementation

Constructs a graph with N vertices and the specified directedness and sentinel value.

N

nonMemberPriority() - Method in class MysteryUpdatablePriorityQueueImplementation

nonMemberPriority() - Method in interface UpdatablePriorityQueue

Returns the sentinel value used by getPriority() to indicate items not currently stored in the queue.

numEdges() - Method in interface Graph

Returns the number of edges in the graph.

numEdges() - Method in class MysteryUnweightedGraphImplementation

numEdges() - Method in class MysteryWeightedGraphImplementation

numVerts() - Method in interface Graph

Returns the number of vertices in the graph.

numVerts() - Method in class MysteryUnweightedGraphImplementation

numVerts() - Method in class MysteryWeightedGraphImplementation

P

peek() - Method in class MysteryPriorityQueueImplementation

peek() - Method in class MysteryQueueImplementation

peek() - Method in class MysteryStackImplementation

peek() - Method in class MysteryUpdatablePriorityQueueImplementation

peek() - Method in interface PriorityQueue

Returns the maximum item in the queue, without removing it.

peek() - Method in interface Queue

Returns the item at the front of the queue, without removing it.

peek() - Method in interface Stack

Returns the item on top of the stack, without removing it.

pop() - Method in class MysteryStackImplementation

pop() - Method in interface Stack

Removes the item from the top of this stack, and returns it.

priority() - Method in class DefaultPriorityPairImplementation

priority() - Method in interface PriorityPair

PriorityPair<T,P extends java.lang.Comparable<? super P>> - Interface in <Unnamed>

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>> - Interface in <Unnamed>

A Java interface for the Priority Queue ADT.

push(T) - Method in class MysteryStackImplementation

push(T) - Method in interface Stack

Adds an item to the top of this stack.

Q

Queue<T> - Interface in <Unnamed>

A Java interface for the Queue ADT.

Queue.EmptyQueueException - Exception in <Unnamed>

An exception to indicate that the queue is empty on dequeue or peek.

R

remove(K) - Method in interface Dictionary

Removes a specific entry from this dictionary.

remove(int) - Method in interface List

Removes the item at the given index, and returns it.

remove(K) - Method in class MysteryDictionaryImplementation

remove(int) - Method in class MysteryListImplementation

remove() - Method in class MysteryPriorityQueueImplementation

remove(T) - Method in class MysterySetImplementation

remove() - Method in class MysteryUpdatablePriorityQueueImplementation

remove() - Method in interface PriorityQueue

Removes the maximum item from the queue, and returns it.

remove(T) - Method in interface Set

Removes the given item.

replace(int, T) - Method in interface List

Replaces the item at a given index.

replace(int, T) - Method in class MysteryListImplementation

S

Set<T> - Interface in <Unnamed>

A Java interface for the Set ADT.

setPriority(Integer, Double) - Method in class MysteryUpdatablePriorityQueueImplementation

setPriority(T, P) - Method in interface UpdatablePriorityQueue

Sets the priority of a given item.

setWeight(int, int, double) - Method in class MysteryWeightedGraphImplementation

setWeight(int, int, double) - Method in interface WeightedGraph

Sets the weight of an edge already in the graph.

size() - Method in interface Dictionary

Returns the size of this dictionary.

size() - Method in class MysteryDictionaryImplementation

size() - Method in class MysterySetImplementation

size() - Method in interface Set

Returns the number of items in the set.

Stack<T> - Interface in <Unnamed>

A Java interface for the Stack ADT.

Stack.EmptyStackException - Exception in <Unnamed>

An exception to indicate that the stack is empty on pop or peek.

T

toArray() - Method in interface List

Returns an array version of the list.

toArray() - Method in class MysteryListImplementation

toArray() - Method in class MysterySetImplementation

toArray() - Method in interface Set

Returns an array containing the same contents as this set, in an arbitrary order.

toString() - Method in class DefaultPriorityPairImplementation

toString() - Method in class MysteryDictionaryImplementation

Returns, e.g., "{key1 → val1; key2 → val2; key3 → val3}".

toString() - Method in class MysteryListImplementation

toString() - Method in class MysterySetImplementation

Returns, e.g., "{val1; val2; val3}".

toString() - Method in class MysteryUnweightedGraphImplementation

toString() - Method in class MysteryWeightedGraphImplementation

U

UnweightedGraph - Interface in <Unnamed>

A Java interface for unweighted graphs.

UpdatablePriorityQueue<T,P extends java.lang.Comparable<? super P>> - Interface in <Unnamed>

A Java interface for the Updatable Priority Queue ADT.

V

value() - Method in interface Dictionary.Entry

W

WeightedGraph - Interface in <Unnamed>

A Java interface for weighted graphs.

A C D E G H I K L M N P Q R S T U V W