A B C D E F H I K L N P Q R S T V W

A

add(E) - Method in class DataStructures.BinaryHeap

Adds an item to the heap.

add(K, V) - Method in interface DataStructures.LookupTable

Adds the specified entry to the table.

add(E) - Method in interface DataStructures.PriorityQueue

Adds an item to the queue.

add(K, V) - Method in class DataStructures.ProbingHashTable

add(E) - Method in class DataStructures.SearchTree

Adds an item into the tree, preserving the ordering property.

add(E) - Method in class DataStructures.StrictBinaryHeap

Adds an item to the heap.

addArc(String, String, int) - Method in class DataStructures.WeightedGraph

Adds a weighted directed arc into the graph.

addFirst(E) - Method in class DataStructures.LinkedList

Inserts an item at the front of the list.

addNode(String) - Method in class DataStructures.WeightedGraph

Adds a node into the graph.

arcs() - Method in class DataStructures.WeightedGraph

Returns an iteration over the arcs in the graph.

B

BinaryHeap<E extends java.lang.Comparable<? super E>> - Class in DataStructures

Binary heap implementation of a priority queue.

BinaryHeap() - Constructor for class DataStructures.BinaryHeap

Constructs an empty binary heap suitable for holding elements of type E.

C

contains(E) - Method in class DataStructures.LinkedList

Tests whether an item is present in the list.

contains(K) - Method in interface DataStructures.LookupTable

Returns true if the table contains an entry for this key.

contains(K) - Method in class DataStructures.ProbingHashTable

contains(E) - Method in class DataStructures.SearchTree

Tests whether the item is present in the tree.

contains(String) - Method in class DataStructures.WeightedGraph

Tests whether a node is present in the graph.

D

DataStructures - package DataStructures

dequeue() - Method in interface DataStructures.Queue

Detaches an item from the queue.

dequeue() - Method in class DataStructures.QueueArray

dequeue() - Method in class DataStructures.QueueList

DoubleHashingTable<K,V> - Class in DataStructures

A probing hash table implementation of a LookupTable with collisions resolved by double hashing.

DoubleHashingTable(int, double) - Constructor for class DataStructures.DoubleHashingTable

Constructs a hash table initially capable of holding the given number of entries subject to the give loadfactor.

DoubleHashingTable(int) - Constructor for class DataStructures.DoubleHashingTable

Constructs a hash table with specified initial size and default load factor.

DoubleHashingTable() - Constructor for class DataStructures.DoubleHashingTable

Constructs a hash table with default initial size and load factor.

E

elementsLevelOrder() - Method in class DataStructures.SearchTree

Provides an enumeration of the elements of the tree in level order.

enqueue(E) - Method in interface DataStructures.Queue

Attaches an item to the queue.

enqueue(E) - Method in class DataStructures.QueueArray

enqueue(E) - Method in class DataStructures.QueueList

equals(Object) - Method in class DataStructures.LinkedList

Implements the equals method.

F

firstItem() - Method in class DataStructures.LinkedList

Returns the first item in the list without removing it.

H

head() - Method in class DataStructures.WeightedGraph.Arc

Returns the head or destination of this arc.

heapSort(E[], int) - Static method in class DataStructures.Sort

Sorts an array a[0..n-1] in ascending order using heapsort.

I

isEmpty() - Method in class DataStructures.BinaryHeap

Tests if the heap is empty.

isEmpty() - Method in class DataStructures.LinkedList

Tests if the list is empty.

isEmpty() - Method in interface DataStructures.LookupTable

Tests if the table is empty.

isEmpty() - Method in interface DataStructures.PriorityQueue

Indicates the status of the queue.

isEmpty() - Method in class DataStructures.ProbingHashTable

isEmpty() - Method in interface DataStructures.Queue

Indicates the status of the queue.

isEmpty() - Method in class DataStructures.QueueArray

isEmpty() - Method in class DataStructures.QueueList

isEmpty() - Method in class DataStructures.SearchTree

Tests if the tree is empty.

isEmpty() - Method in interface DataStructures.Stack

Indicates the status of the stack.

isEmpty() - Method in class DataStructures.StackArray

isEmpty() - Method in class DataStructures.StackList

isEmpty() - Method in class DataStructures.StrictBinaryHeap

Tests if the heap is empty.

iterator() - Method in class DataStructures.LinkedList

Iterates over the items in the list.

iterator() - Method in interface DataStructures.LookupTable

Returns an iteration over the entries in this lookup table.

iterator() - Method in class DataStructures.ProbingHashTable

iterator() - Method in class DataStructures.SearchTree

Iterates over the items in the tree using the in-order sequence.

iterator() - Method in class DataStructures.WeightedGraph

Returns the arcs iterator

K

key() - Method in interface DataStructures.LookupTable.Entry

Returns the key of this entry.

L

LinkedList<E> - Class in DataStructures

A simple implementation of singly linked lists.

LinkedList() - Constructor for class DataStructures.LinkedList

Constructs an empty list suitable for holding items of type E.

lookup(K) - Method in interface DataStructures.LookupTable

Returns the value associated with the specified key.

lookup(K) - Method in class DataStructures.ProbingHashTable

LookupTable<K,V> - Interface in DataStructures

A simple interface for a lookup table.

LookupTable.Entry<K,V> - Interface in DataStructures

A class of objects returned by iteration over entries.

N

nodes() - Method in class DataStructures.WeightedGraph

Returns an iteration over the nodes in the graph.

nrArcs() - Method in class DataStructures.WeightedGraph

Returns the number of arcs in the graph

nrNodes() - Method in class DataStructures.SearchTree

Counts the number of nodes in the tree.

nrNodes() - Method in class DataStructures.WeightedGraph

Returns the number of nodes in the graph

P

pathExists(String, String) - Method in class DataStructures.WeightedGraph

Tests whether a path exists between two given nodes.

pop() - Method in interface DataStructures.Stack

Pops an item off the stack.

pop() - Method in class DataStructures.StackArray

pop() - Method in class DataStructures.StackList

PriorityQueue<E extends java.lang.Comparable<? super E>> - Interface in DataStructures

Interface for a priority queue of elements of type E.

ProbingHashTable<K,V> - Class in DataStructures

An abstract class implementing the LookupTable interface by means of a probing hash table.

push(E) - Method in interface DataStructures.Stack

Pushes an item onto the stack.

push(E) - Method in class DataStructures.StackArray

push(E) - Method in class DataStructures.StackList

Q

QuadraticProbingTable<K,V> - Class in DataStructures

A probing hash table implementation of a LookupTable with collisions resolved by quadratic probing.

QuadraticProbingTable(int, double) - Constructor for class DataStructures.QuadraticProbingTable

Constructs a hash table initially capable of holding the given number of entries subject to the give loadfactor.

QuadraticProbingTable(int) - Constructor for class DataStructures.QuadraticProbingTable

Constructs a hash table with specified initial size and default load factor.

QuadraticProbingTable() - Constructor for class DataStructures.QuadraticProbingTable

Constructs a hash table with default initial size and load factor.

Queue<E> - Interface in DataStructures

A first-in-first-out (FIFO) queue of objects.

QueueArray<E> - Class in DataStructures

An array implementation of a queue

QueueArray() - Constructor for class DataStructures.QueueArray

Creates an empty queue suitable for holding items of type E

QueueList<E> - Class in DataStructures

A linked list implementation of a queue

QueueList() - Constructor for class DataStructures.QueueList

Creates an empty queue suitable for holding items of type E

R

readGraphTxtFile(String) - Method in class DataStructures.WeightedGraph

Reads a graph description from a text file.

remove() - Method in class DataStructures.BinaryHeap

Removes an item of highest priority from the heap.

remove(K) - Method in interface DataStructures.LookupTable

Removes the entry corresponding to the key.

remove() - Method in interface DataStructures.PriorityQueue

Removes an item of highest priority from the queue.

remove(K) - Method in class DataStructures.ProbingHashTable

remove(E) - Method in class DataStructures.SearchTree

Removes an item from the tree, preserving the ordering property.

remove() - Method in class DataStructures.StrictBinaryHeap

Removes an item of highest priority item from the heap.

removeFirst() - Method in class DataStructures.LinkedList

Removes the first item from the list without returning it.

reverse() - Method in class DataStructures.LinkedList

Reverses the list.

S

SearchTree<E extends java.lang.Comparable<? super E>> - Class in DataStructures

A class implementing binary search trees for elements of type E.

SearchTree() - Constructor for class DataStructures.SearchTree

Constructs an empty tree suitable for holding comparable elements of type E

shortestPath(String, String) - Method in class DataStructures.WeightedGraph

Enumerates the nodes in a shortest path between two given nodes.

shortestPathLength(String, String) - Method in class DataStructures.WeightedGraph

Returns the length of a shortest path between two given nodes.

size() - Method in class DataStructures.BinaryHeap

Returns the current size of the queue

size() - Method in class DataStructures.LinkedList

Returns the length of the list

size() - Method in interface DataStructures.LookupTable

Returns the number of entries in the table.

size() - Method in interface DataStructures.PriorityQueue

Returns the current size of the queue

size() - Method in class DataStructures.ProbingHashTable

size() - Method in class DataStructures.StrictBinaryHeap

Returns the current size of the queue.

Sort - Class in DataStructures

A class providing static array sorting routines

Stack<E> - Interface in DataStructures

A last-in-first-out (LIFO) stack of objects.

StackArray<E> - Class in DataStructures

An array implementation of a stack

StackArray() - Constructor for class DataStructures.StackArray

Creates an empty stack suitable for holding items of type E

StackList<E> - Class in DataStructures

A linked list implementation of a stack

StackList() - Constructor for class DataStructures.StackList

Creates an empty stack suitable for holding items of type E

StrictBinaryHeap<E extends java.lang.Comparable<? super E>> - Class in DataStructures

Binary heap implementation of a priority queue, in which items of the same priority are removed in order of insertion.

StrictBinaryHeap() - Constructor for class DataStructures.StrictBinaryHeap

Constructs the binary heap.

T

tail() - Method in class DataStructures.WeightedGraph.Arc

Returns the tail or source of this arc.

toString() - Method in class DataStructures.LinkedList

Converts the list to a string.

toString() - Method in class DataStructures.SearchTree

Converts the tree to a string.

toString() - Method in class DataStructures.WeightedGraph.Arc

Represents the arc as a string.

V

value() - Method in interface DataStructures.LookupTable.Entry

Returns the value of this entry.

W

weight() - Method in class DataStructures.WeightedGraph.Arc

Returns the weight attached to this arc.

WeightedGraph - Class in DataStructures

A class implementing a weighted directed graph and shortest path algorithms for a positively weighted graph.

WeightedGraph() - Constructor for class DataStructures.WeightedGraph

Constructs an empty weighted graph

WeightedGraph.Arc - Class in DataStructures

A public class returned by WeightedGraph.arcs().

writeGraphTxtFile(String) - Method in class DataStructures.WeightedGraph

Writes a graph description to a text file.

A B C D E F H I K L N P Q R S T V W