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

A

add(K, V) - Method in interface Dictionary

Adds a new entry to this dictionary.

add(T) - Method in interface Heap

Adds the given item to the heap.

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(T) - Method in class MysteryListImplementation

Adds newItem to the end of the list.

add(int, T) - Method in class MysteryListImplementation

Adds newItem at the given index, and shifts each item at or beyond that index to the next higher index.

add(T) - Method in interface PriorityQueue

Adds the given item to the queue.

add(T) - Method in interface SearchTree

Adds the given item to the tree.

add(T) - Method in interface Set

Adds the given item to the set, ignoring duplicates.

addEdge(int, int) - Method in class MysteryUnweightedGraphImplementation

Adds an edge between two vertices.

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

Adds a weighted edge between two vertices.

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

Adds a new vertex.

addVertex() - Method in class MysteryWeightedGraphImplementation

Adds a new vertex.

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 Heap

Removes all items from the heap.

clear() - Method in interface List

Removes all items from the list.

clear() - Method in class MysteryListImplementation

clear() - Method in class MysteryQueueImplementation

clear() - Method in class MysteryStackImplementation

clear() - Method in class MysteryUnweightedGraphImplementation

Removes all vertices and edges from the graph.

clear() - Method in class MysteryWeightedGraphImplementation

Removes all vertices and edges from the graph.

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 SearchTree

Removes all items from the tree.

clear() - Method in interface Set

Removes all items from the set.

clear() - Method in interface Stack

Removes all items from the stack.

contains(K) - Method in interface Dictionary

Sees whether a specific entry is in this dictionary.

contains(T) - Method in interface List

Returns true if the list contains the target item.

contains(T) - Method in class MysteryListImplementation

contains(T) - Method in interface SearchTree

Checks whether the given item is in the tree.

contains(T) - Method in interface Set

Checks whether the given item is in the set.

D

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>

An interface for the Dictionary ADT.

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

A simple interface for key-value pairs.

DisjointSets - Interface in <Unnamed>

Java interface for the Disjoint-Sets ADT (also known as a "union-find" data structure).

E

enqueue(T) - Method in class MysteryQueueImplementation

enqueue(T) - Method in interface Queue

Adds the given item to the back of the queue.

F

find(int) - Method in interface DisjointSets

Returns the label of the subset containing item i.

find(int) - Method in class MysteryDisjointSetsImplementation

G

getDegree(int) - Method in interface Graph

Returns the out-degree of the specified vertex.

getDegree(int) - Method in class MysteryUnweightedGraphImplementation

Returns the out-degree of the specified vertex.

getDegree(int) - Method in class MysteryWeightedGraphImplementation

Returns the out-degree of the specified vertex.

getEntrySet() - Method in interface Dictionary

Returns a Set of the key-value pairs stored in the dictionary.

getInDegree(int) - Method in interface Graph

Returns the in-degree of the specified vertex.

getInDegree(int) - Method in class MysteryUnweightedGraphImplementation

Returns the in-degree of the specified vertex.

getInDegree(int) - Method in class MysteryWeightedGraphImplementation

Returns the in-degree of the specified vertex.

getKey() - Method in interface DictPair

getKeySet() - Method in interface Dictionary

Returns a Set that contains all the keys stored in the dictionary.

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

Returns an iterator over the neighbors of the specified vertex.

getNeighbors(int) - Method in class MysteryWeightedGraphImplementation

Returns an iterator over the neighbors of the specified vertex.

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

Retrieves from this dictionary the value associated with a given key.

getValue() - Method in interface DictPair

getWeight(int, int) - Method in class MysteryWeightedGraphImplementation

Gets the weight of the edge between two vertices.

getWeight(int, int) - Method in interface WeightedGraph

Gets the weight of the edge between two vertices.

Graph - Interface in <Unnamed>

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

H

hasEdge(int, int) - Method in interface Graph

Checks whether an edge exists between two vertices.

hasEdge(int, int) - Method in class MysteryUnweightedGraphImplementation

Checks whether an edge exists between two vertices.

hasEdge(int, int) - Method in class MysteryWeightedGraphImplementation

Checks whether an edge exists between two vertices.

Heap<T extends java.lang.Comparable<? super T>> - Interface in <Unnamed>

An interface for the Max-Heap ADT.

height() - Method in interface SearchTree

Returns the height of the tree.

I

inOrderTraversal() - Method in interface SearchTree

Returns a list of all the items in this search tree in order.

intersect(Set<T>) - Method in interface Set

Creates a new Set and returns an intersections of this set and otherSet.

isDirected() - Method in interface Graph

Returns true if the graph is directed.

isDirected() - Method in class MysteryUnweightedGraphImplementation

Returns true if the graph is directed.

isDirected() - Method in class MysteryWeightedGraphImplementation

Returns true if the graph is directed.

isEmpty() - Method in interface Dictionary

Sees whether this dictionary is empty.

isEmpty() - Method in interface Graph

Returns true if there are no vertices in the graph.

isEmpty() - Method in interface Heap

Returns true if the heap is empty.

isEmpty() - Method in interface List

Returns true if the list has no items stored in it.

isEmpty() - Method in class MysteryListImplementation

isEmpty() - Method in class MysteryQueueImplementation

isEmpty() - Method in class MysteryStackImplementation

isEmpty() - Method in class MysteryUnweightedGraphImplementation

Returns true if there are no vertices in the graph.

isEmpty() - Method in class MysteryWeightedGraphImplementation

Returns true if there are no vertices in the graph.

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 SearchTree

Returns whether the tree is empty.

isEmpty() - Method in interface Set

Returns whether the set is empty.

isEmpty() - Method in interface Stack

Returns true if the stack is empty.

item() - Method in interface PriorityPair

iterator() - Method in interface List

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

iterator() - Method in class MysteryListImplementation

iterator() - Method in interface SearchTree

Returns an iterator over the in-order traversal of the tree.

iterator() - Method in interface Set

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

L

length() - Method in interface List

Returns the length of the list: the number of items stored in it.

length() - Method in class MysteryListImplementation

List<T> - Interface in <Unnamed>

An interface for the List ADT.

M

main(String[]) - Static method in class MysteryListImplementation

main(String[]) - Static method in class MysteryQueueImplementation

main(String[]) - Static method in class MysteryStackImplementation

missingEdgeSentinel() - Method in class MysteryWeightedGraphImplementation

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

missingEdgeSentinel() - Method in interface WeightedGraph

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

MysteryDisjointSetsImplementation - Class in <Unnamed>

A mysterious implementation of the Disjoin-Sets ADT!

MysteryDisjointSetsImplementation(int) - Constructor for class MysteryDisjointSetsImplementation

Constructs a disjoint-sets structure for N items, each of which initially belongs to its own subset (all labels are different).

MysteryListImplementation<T> - Class in <Unnamed>

An implementation of the List ADT.

MysteryListImplementation() - Constructor for class MysteryListImplementation

Default constructor: creates an empty list.

MysteryQueueImplementation<T> - Class in <Unnamed>

An implementation of the Queue ADT.

MysteryQueueImplementation() - Constructor for class MysteryQueueImplementation

Default constructor for an empty queue.

MysteryStackImplementation<T> - Class in <Unnamed>

An implementation of the Stack ADT.

MysteryStackImplementation() - Constructor for class MysteryStackImplementation

Default constructor: creates an empty stack.

MysteryUnweightedGraphImplementation - Class in <Unnamed>

An 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.

MysteryWeightedGraphImplementation - Class in <Unnamed>

An 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 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

Returns the number of edges in the graph.

numEdges() - Method in class MysteryWeightedGraphImplementation

Returns the number of edges in the graph.

numVerts() - Method in interface Graph

Returns the number of vertices in the graph.

numVerts() - Method in class MysteryUnweightedGraphImplementation

Returns the number of vertices in the graph.

numVerts() - Method in class MysteryWeightedGraphImplementation

Returns the number of vertices in the graph.

P

peek() - Method in interface Heap

Returns the maximum value, but doesn't change the heap.

peek() - Method in class MysteryQueueImplementation

peek() - Method in class MysteryStackImplementation

Return the top item from the stack but don't remove it.

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

Remove the top item from the stack and return it.

pop() - Method in interface Stack

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

postOrderTraversal() - Method in interface SearchTree

Returns a List of all the items in the tree, ordered as in a prost-order traversal.

preOrderTraversal() - Method in interface SearchTree

Returns a List of all the items in the tree, ordered as in a pre-order traversal.

priority() - Method in interface PriorityPair

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

A utility interface for the Updatable Priority Queue ADT to work with an item and its priority simultaneously.

PriorityQueue<T extends java.lang.Comparable<? super T>> - Interface in <Unnamed>

An interface for the Priority Queue ADT.

push(T) - Method in class MysteryStackImplementation

Store an item in the stack.

push(T) - Method in interface Stack

Adds an item to the top of this stack.

Q

Queue<T> - Interface in <Unnamed>

An interface for the Queue ADT.

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.

remove(int) - Method in class MysteryListImplementation

Removes the item at the given index, and shifts each item beyond that index to the next lower index.

remove() - Method in interface PriorityQueue

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

remove(T) - Method in interface SearchTree

Removes the given item from the tree.

remove(T) - Method in interface Set

Removes the given item.

removeRoot() - Method in interface Heap

Removes and returns the maximum value in the heap.

replace(int, T) - Method in interface List

Replaces the item at a given index.

replace(int, T) - Method in class MysteryListImplementation

S

SearchTree<T extends java.lang.Comparable<? super T>> - Interface in <Unnamed>

Interface for the Search Tree ADT.

Set<T> - Interface in <Unnamed>

An ADT that represents a set: a bunch of items that must be distinct from each other, stored with no defined order.

setPriority(T, P) - Method in interface UpdatablePriorityQueue

Sets the priority of a given item.

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

Sets the weight of an edge already in the graph.

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

Sets the weight of an edge already in the graph.

size() - Method in interface Dictionary

Gets the size of this dictionary.

size() - Method in interface SearchTree

Returns the number of items in the tree.

size() - Method in interface Set

Returns the number of items in the set.

Stack<T> - Interface in <Unnamed>

An interface for the Stack ADT.

T

toArray() - Method in interface List

Returns an array version of the list.

toArray() - Method in class MysteryListImplementation

toArray() - Method in interface Set

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

U

union(int, int) - Method in interface DisjointSets

Joins the subsets containing items i and j.

union(int, int) - Method in class MysteryDisjointSetsImplementation

union(Set<T>) - Method in interface Set

Creates a new Set and returns a union of this set and otherSet.

UnweightedGraph - Interface in <Unnamed>

An interface for unweighted graphs.

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

An interface for the Updatable Priority Queue ADT, which allows the user to query and change the priority of items in the queue.

W

WeightedGraph - Interface in <Unnamed>

An interface for weighted graphs.

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