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

A

AB - class misc.AB.
 
AB() - Constructor for class misc.AB
 
Abc - class misc.Abc.
 
Abc() - Constructor for class misc.Abc
 
abc(Computable, Computable, Computable) - Static method in class misc.GenericAbc
 
abc(float, float, float) - Static method in class misc.FloatAbc
 
abc(int, int, int) - Static method in class misc.IntegerAbcWithException
 
abc(int, int, int) - Static method in class misc.Abc
 
abc(int, int, int) - Static method in class misc.IntegerAbc
 
add(Currency) - Method in class applications.Currency
 
Add(Currency2) - Method in class applications.Currency2
return this + x
add(CurrencyAsLong) - Method in class applications.CurrencyAsLong
 
add(int[][], int[][], int[][], int, int) - Static method in class misc.MatrixAddStepCount1
Add two rows x cols integer matrices.
add(int[][], int[][], int[][], int, int) - Static method in class misc.MatrixAddStepCount2
Add two rows x cols integer matrices.
add(int[][], int[][], int[][], int, int) - Static method in class utilities.MatrixOperations
Add two rows x cols integer matrices.
add(int, Object) - Method in class dataStructures.Chain
Insert an element with specified index.
add(int, Object) - Method in class dataStructures.ArrayLinearList
Insert an element with specified index.
add(int, Object) - Method in class dataStructures.SimulatedChain
Insert an element with specified index.
add(int, Object) - Method in interface dataStructures.LinearList
 
add(int, Object) - Method in class dataStructures.LinearListAsVector
Insert an element with specified index.
add(int, Object) - Method in class dataStructures.LinearListAsAbstractClass
 
add(int, Object) - Method in class dataStructures.ExtendedChain
Insert an element with specified index.
add(int, Object) - Method in class dataStructures.ArrayLinearListWithIterator
Insert an element with specified index.
add(int, Object) - Method in class dataStructures.FastArrayLinearList
Insert an element with specified index.
add(Matrix) - Method in class dataStructures.Matrix
 
add(Object) - Method in interface dataStructures.ExtendedLinearList
 
add(Object) - Method in class dataStructures.ExtendedChain
Add theElement to the right end of the chain.
add(Object) - Method in class utilities.Dummy
 
add(Object) - Method in interface utilities.Computable
 
add(Object) - Method in class wrappers.MyInteger
 
add(Object) - Method in class wrappers.MyDouble
 
add(SparseMatrixAsExtendedArrayLinearList) - Method in class dataStructures.SparseMatrixAsExtendedArrayLinearList
 
add(SparseMatrixAsExtendedArrayList) - Method in class dataStructures.SparseMatrixAsExtendedArrayList
 
add(SparseMatrixAsVector) - Method in class dataStructures.SparseMatrixAsVector
 
add1(BinaryTreeNode) - Static method in class dataStructures.LinkedBinaryTree
visit method to count nodes
add1(Object) - Static method in class applications.TreeHistogramming
increment the count of e by 1
AdjacencyDigraph - class dataStructures.AdjacencyDigraph.
 
AdjacencyDigraph() - Constructor for class dataStructures.AdjacencyDigraph
 
AdjacencyDigraph(int) - Constructor for class dataStructures.AdjacencyDigraph
 
AdjacencyGraph - class dataStructures.AdjacencyGraph.
 
AdjacencyGraph() - Constructor for class dataStructures.AdjacencyGraph
 
AdjacencyGraph(int) - Constructor for class dataStructures.AdjacencyGraph
 
AdjacencyWDigraph - class dataStructures.AdjacencyWDigraph.
 
AdjacencyWDigraph() - Constructor for class dataStructures.AdjacencyWDigraph
 
AdjacencyWDigraph(int) - Constructor for class dataStructures.AdjacencyWDigraph
 
AdjacencyWGraph - class dataStructures.AdjacencyWGraph.
 
AdjacencyWGraph() - Constructor for class dataStructures.AdjacencyWGraph
 
AdjacencyWGraph(int) - Constructor for class dataStructures.AdjacencyWGraph
 
allocateNode(Object, int) - Method in class dataStructures.SimulatedSpace2
 
allocateNode(Object, int) - Method in class dataStructures.SimulatedSpace1
 
allPairs(Operable[][], int[][]) - Method in class dataStructures.AdjacencyWDigraph
dynamic programming all pairs shortest paths algorithm compute c[i][j] and kay[i][j] for all i and j
applications - package applications
 
arrangeBoards(int[][], int, int[]) - Static method in class applications.RecursiveBTBoard
preprocessor for recursive backtracking method
Array1D - class misc.Array1D.
 
Array1D() - Constructor for class misc.Array1D
 
ArrayLinearList - class dataStructures.ArrayLinearList.
 
ArrayLinearList() - Constructor for class dataStructures.ArrayLinearList
create a list with initial capacity 10
ArrayLinearList(int) - Constructor for class dataStructures.ArrayLinearList
create a list with initial capacity initialCapacity
ArrayLinearListWithIterator - class dataStructures.ArrayLinearListWithIterator.
 
ArrayLinearListWithIterator() - Constructor for class dataStructures.ArrayLinearListWithIterator
create a list with initial capacity 10
ArrayLinearListWithIterator(int) - Constructor for class dataStructures.ArrayLinearListWithIterator
create a list with initial capacity initialCapacity
ArrayQueue - class dataStructures.ArrayQueue.
 
ArrayQueue() - Constructor for class dataStructures.ArrayQueue
create a queue with initial capacity 10
ArrayQueue(int) - Constructor for class dataStructures.ArrayQueue
create a queue with the given initial capacity
ArrayStack - class dataStructures.ArrayStack.
 
ArrayStack() - Constructor for class dataStructures.ArrayStack
create a stack with initial capacity 10
ArrayStack(int) - Constructor for class dataStructures.ArrayStack
create a stack with the given initial capacity
ascend() - Method in class dataStructures.BinarySearchTree
output elements in ascending order of key
ascend() - Method in interface dataStructures.BSTree
 
AverageSortTime - class misc.AverageSortTime.
 
AverageSortTime() - Constructor for class misc.AverageSortTime
 

B

bellmanFord(int, Operable[], int[], Operable) - Method in class dataStructures.Graph
Bellman and Ford algorithm to find the shortest paths from vertex s.
BestFit - class applications.BestFit.
 
BestFit.BinNode - class applications.BestFit.BinNode.
 
BestFit.BinNode(int, int) - Constructor for class applications.BestFit.BinNode
 
BestFit() - Constructor for class applications.BestFit
 
bestFitPack(int[], int) - Static method in class applications.BestFit
output best fit packing into bins of size binCapacity
bfs(int, int[], int) - Method in class dataStructures.Graph
breadth-first search reach[i] is set to label for all vertices reachable from vertex v
bfs(int, int[], int) - Method in class dataStructures.LinkedDigraph
breadth-first search
bfs(int, int[], int) - Method in class dataStructures.AdjacencyDigraph
breadth-first search
BinarySearch - class applications.BinarySearch.
 
BinarySearch() - Constructor for class applications.BinarySearch
 
binarySearch(Comparable[], Comparable) - Static method in class applications.BinarySearch
Search the ordered array a for x.
BinarySearchTree - class dataStructures.BinarySearchTree.
 
BinarySearchTree() - Constructor for class dataStructures.BinarySearchTree
 
BinarySearchTreeWithVisit - class dataStructures.BinarySearchTreeWithVisit.
 
BinarySearchTreeWithVisit() - Constructor for class dataStructures.BinarySearchTreeWithVisit
 
BinaryTree - interface dataStructures.BinaryTree.
 
BinaryTreeNode - class dataStructures.BinaryTreeNode.
 
BinaryTreeNode() - Constructor for class dataStructures.BinaryTreeNode
 
BinaryTreeNode(Object) - Constructor for class dataStructures.BinaryTreeNode
 
BinaryTreeNode(Object, BinaryTreeNode, BinaryTreeNode) - Constructor for class dataStructures.BinaryTreeNode
 
BinaryTreeTraversal - class dataStructures.BinaryTreeTraversal.
 
BinaryTreeTraversal() - Constructor for class dataStructures.BinaryTreeTraversal
 
BinSort - class applications.BinSort.
 
BinSort() - Constructor for class applications.BinSort
 
binSort(Chain, int) - Static method in class applications.BinSort
sort theChain using the bin sort method
binSort(int) - Static method in class applications.ChainWithBinSort
sort the chain c using the bin sort method
binSort(int) - Method in class dataStructures.ChainWithBinSort
sort the chain using the bin sort method
bipartiteCover(int[], int[]) - Method in class dataStructures.Graph
 
BSTree - interface dataStructures.BSTree.
 
btMaxClique(int[]) - Method in class dataStructures.AdjacencyGraph
solve max-clique problem using backtracking
btSalesperson(int[], Operable) - Method in class dataStructures.AdjacencyWDigraph
traveling salesperson by backtracking
BubbleSort - class applications.BubbleSort.
 
BubbleSort() - Constructor for class applications.BubbleSort
 
bubbleSort(Comparable[]) - Static method in class applications.BubbleSort
sort the array a using the bubble sort method
bubbleSort(Comparable[]) - Static method in class applications.EarlyTerminatingBubbleSort
early-terminating bubble sort

C

Chain - class dataStructures.Chain.
 
Chain() - Constructor for class dataStructures.Chain
 
Chain(int) - Constructor for class dataStructures.Chain
create a list that is empty
ChainIterator - class dataStructures.ChainIterator.
 
ChainIterator(Chain) - Constructor for class dataStructures.ChainIterator
 
ChainWithBinSort - class applications.ChainWithBinSort.
 
ChainWithBinSort - class dataStructures.ChainWithBinSort.
 
ChainWithBinSort() - Constructor for class applications.ChainWithBinSort
 
ChainWithBinSort() - Constructor for class dataStructures.ChainWithBinSort
 
ChangeArrayLength - class utilities.ChangeArrayLength.
 
ChangeArrayLength() - Constructor for class utilities.ChangeArrayLength
 
ChangeArraySize - class utilities.ChangeArraySize.
 
ChangeArraySize() - Constructor for class utilities.ChangeArraySize
 
changeLength1D(Object[], int) - Static method in class utilities.ChangeArrayLength
 
changeLength1D(Object[], int, int) - Static method in class utilities.ChangeArrayLength
Change the length of the 1D array a.
changeSize1D(Object[], int) - Static method in class utilities.ChangeArraySize
 
changeSize1D(Object[], int, int) - Static method in class utilities.ChangeArraySize
Change the size of the 1D array a.
checkBox(int[]) - Static method in class applications.SwitchBox
determine whether the switch box is routable
Chessboard - class applications.Chessboard.
 
Chessboard(int) - Constructor for class applications.Chessboard
 
CircularWithHeader - class dataStructures.CircularWithHeader.
 
CircularWithHeader() - Constructor for class dataStructures.CircularWithHeader
create a circular list that is empty
clear() - Method in interface dataStructures.ExtendedLinearList
 
clear() - Method in class dataStructures.ExtendedChain
Make the chain empty.
clone() - Method in class dataStructures.Matrix
 
clone() - Method in interface utilities.CloneableObject
 
clone() - Method in class wrappers.MyInteger
make a clone
clone() - Method in class wrappers.MyDouble
make a clone
CloneableObject - interface utilities.CloneableObject.
Interface to be implemented by all classes that implement the method clone.
closestPair(ClosestPoints.Point1[]) - Static method in class applications.ClosestPoints
 
ClosestPoints - class applications.ClosestPoints.
 
ClosestPoints.Point - class applications.ClosestPoints.Point.
point in 2D
ClosestPoints.Point(double, double) - Constructor for class applications.ClosestPoints.Point
 
ClosestPoints.Point1 - class applications.ClosestPoints.Point1.
point with id, implements Comparable using x-coordinates
ClosestPoints.Point1(double, double, int) - Constructor for class applications.ClosestPoints.Point1
 
ClosestPoints.Point2 - class applications.ClosestPoints.Point2.
point with an integer field, implements Comparable using y-coordinates
ClosestPoints.Point2(double, double, int) - Constructor for class applications.ClosestPoints.Point2
 
ClosestPoints.PointPair - class applications.ClosestPoints.PointPair.
pairs of points and their distance
ClosestPoints.PointPair(ClosestPoints.Point1, ClosestPoints.Point1, double) - Constructor for class applications.ClosestPoints.PointPair
 
ClosestPoints() - Constructor for class applications.ClosestPoints
 
ComparableEdge - class dataStructures.ComparableEdge.
 
ComparableEdge(int, int, Comparable) - Constructor for class dataStructures.ComparableEdge
 
compareTo(Object) - Method in class applications.ClosestPoints.Point1
 
compareTo(Object) - Method in class applications.ClosestPoints.Point2
 
compareTo(Object) - Method in class applications.Container
 
compareTo(Object) - Method in class dataStructures.ComparableEdge
 
compareTo(Object) - Method in class utilities.Dummy
 
compareTo(Object) - Method in interface utilities.MyComparable
 
compareTo(Object) - Method in class wrappers.MyInteger
 
compareTo(Object) - Method in class wrappers.MyDouble
 
CompleteWinnerTree - class dataStructures.CompleteWinnerTree.
 
CompleteWinnerTree() - Constructor for class dataStructures.CompleteWinnerTree
 
Compress - class applications.Compress.
 
Compress() - Constructor for class applications.Compress
 
Computable - interface utilities.Computable.
Interface to be implemented by all classes that permit the standard arithmetic operations.
connected() - Method in class dataStructures.Graph
 
Container - class applications.Container.
 
Container(int, int) - Constructor for class applications.Container
 
containerLoading(Container[], int, int[]) - Static method in class applications.GreedyLoading
greedy algorithm for container loading set x[i] = 1 iff container i, i >= 1 is loaded
ConvertSortTimes - class applications.ConvertSortTimes.
 
ConvertSortTimes() - Constructor for class applications.ConvertSortTimes
 
ConvertString - class dataStructures.ConvertString.
 
ConvertString() - Constructor for class dataStructures.ConvertString
 
copy(Matrix) - Method in class dataStructures.Matrix
copy the references in m into this
CrossingDistribution - class applications.CrossingDistribution.
 
CrossingDistribution() - Constructor for class applications.CrossingDistribution
 
Currency - class applications.Currency.
 
Currency() - Constructor for class applications.Currency
initialize instance to $0.00
Currency(boolean, long, byte) - Constructor for class applications.Currency
initialize instance to theSign $ theDollars.theCents
Currency(double) - Constructor for class applications.Currency
initialize with double
Currency2 - class applications.Currency2.
 
Currency2() - Constructor for class applications.Currency2
initialize instance to $0.00
Currency2(boolean, long, byte) - Constructor for class applications.Currency2
initialize instance to theSign $ theDollars.theCents
Currency2(double) - Constructor for class applications.Currency2
initialize with double
CurrencyAsLong - class applications.CurrencyAsLong.
 
CurrencyAsLong() - Constructor for class applications.CurrencyAsLong
initialize instance to $0.00
CurrencyAsLong(boolean, long, byte) - Constructor for class applications.CurrencyAsLong
initialize instance to theSign $ theDollars.theCents
CurrencyAsLong(double) - Constructor for class applications.CurrencyAsLong
initialize with double

D

D - class misc.D.
 
D() - Constructor for class misc.D
 
d(int[], int) - Static method in class misc.AB
method to do this
d(int[], int) - Static method in class misc.D
 
dataStructures - package dataStructures
 
DBinarySearchTree - class dataStructures.DBinarySearchTree.
 
DBinarySearchTree() - Constructor for class dataStructures.DBinarySearchTree
 
DBinarySearchTreeWithGE - class dataStructures.DBinarySearchTreeWithGE.
 
DBinarySearchTreeWithGE() - Constructor for class dataStructures.DBinarySearchTreeWithGE
 
deallocateNode(int) - Method in class dataStructures.SimulatedSpace2
 
deallocateNode(int) - Method in class dataStructures.SimulatedSpace1
 
Decompress - class applications.Decompress.
 
Decompress() - Constructor for class applications.Decompress
 
decrement(Object) - Method in class utilities.Dummy
 
decrement(Object) - Method in interface utilities.Computable
 
decrement(Object) - Method in class wrappers.MyInteger
 
decrement(Object) - Method in class wrappers.MyDouble
 
degree(int) - Method in class dataStructures.Graph
 
degree(int) - Method in class dataStructures.LinkedDigraph
this method is undefined for directed graphs
degree(int) - Method in class dataStructures.LinkedGraph
 
degree(int) - Method in interface dataStructures.Network
 
degree(int) - Method in class dataStructures.AdjacencyDigraph
this method is undefined for directed graphs
degree(int) - Method in class dataStructures.AdjacencyGraph
 
degree(int) - Method in class dataStructures.AdjacencyWDigraph
this method is undefined for directed graphs
degree(int) - Method in class dataStructures.AdjacencyWGraph
 
DerivedArrayStack - class dataStructures.DerivedArrayStack.
 
DerivedArrayStack() - Constructor for class dataStructures.DerivedArrayStack
create a stack with initial capacity 10
DerivedArrayStack(int) - Constructor for class dataStructures.DerivedArrayStack
create a stack with the given initial capacity
DerivedArrayStackWithCatch - class dataStructures.DerivedArrayStackWithCatch.
 
DerivedArrayStackWithCatch() - Constructor for class dataStructures.DerivedArrayStackWithCatch
create a stack with initial capacity 10
DerivedArrayStackWithCatch(int) - Constructor for class dataStructures.DerivedArrayStackWithCatch
create a stack with the given initial capacity
DerivedLinkedStack - class dataStructures.DerivedLinkedStack.
 
DerivedLinkedStack() - Constructor for class dataStructures.DerivedLinkedStack
 
DerivedLinkedStack(int) - Constructor for class dataStructures.DerivedLinkedStack
included only for compatibility with other stack classes
DerivedVectorStack - class dataStructures.DerivedVectorStack.
 
DerivedVectorStack() - Constructor for class dataStructures.DerivedVectorStack
create a stack with initial capacity 10
DerivedVectorStack(int) - Constructor for class dataStructures.DerivedVectorStack
create a stack with the given initial capacity
dfs(int, int[], int) - Method in class dataStructures.Graph
depth-first search reach[i] is set to label for all vertices reachable from vertex v
DiagonalMatrix - class dataStructures.DiagonalMatrix.
 
DiagonalMatrix(int, Object) - Constructor for class dataStructures.DiagonalMatrix
 
Dictionary - interface dataStructures.Dictionary.
 
dist(ClosestPoints.Point, ClosestPoints.Point) - Static method in class applications.ClosestPoints
 
divide(Object) - Method in class utilities.Dummy
 
divide(Object) - Method in interface utilities.Computable
 
divide(Object) - Method in class wrappers.MyInteger
 
divide(Object) - Method in class wrappers.MyDouble
 
divisor - Variable in class dataStructures.HashTable
 
doubleValue() - Method in class wrappers.MyDouble
 
Dummy - class utilities.Dummy.
 
Dummy() - Constructor for class utilities.Dummy
 

E

EarlyTerminatingBubbleSort - class applications.EarlyTerminatingBubbleSort.
 
EarlyTerminatingBubbleSort() - Constructor for class applications.EarlyTerminatingBubbleSort
 
EarlyTerminatingSelectionSort - class applications.EarlyTerminatingSelectionSort.
 
EarlyTerminatingSelectionSort() - Constructor for class applications.EarlyTerminatingSelectionSort
 
Edge - class dataStructures.Edge.
 
Edge(int, int) - Constructor for class dataStructures.Edge
 
EdgeNode - class dataStructures.EdgeNode.
 
EdgeNode(int) - Constructor for class dataStructures.EdgeNode
 
edges() - Method in class dataStructures.Graph
 
edges() - Method in class dataStructures.LinkedDigraph
 
edges() - Method in interface dataStructures.Network
 
edges() - Method in class dataStructures.AdjacencyDigraph
 
edges() - Method in class dataStructures.AdjacencyWDigraph
 
element - Variable in class dataStructures.ArrayLinearList
 
element - Variable in class dataStructures.HashTable.HashEntry
 
element - Variable in class dataStructures.LinearListAsVector
 
element - Variable in class dataStructures.FormulaBasedLinearList
 
element - Variable in class dataStructures.VectorLinearList
 
element - Variable in class dataStructures.SortedChain.SortedChainNode
 
element - Variable in class dataStructures.ArrayLinearListWithIterator
 
element - Variable in class dataStructures.FastArrayLinearList
 
element - Variable in class dataStructures.SkipList.SkipNode
 
elementAt(int) - Method in class dataStructures.FormulaBasedLinearList
 
elementAt(int) - Method in class dataStructures.VectorLinearList
 
elements() - Method in class dataStructures.SimulatedChain
create and return an iterator
elements() - Method in class dataStructures.FormulaBasedLinearList
create and return an enumerator
elements() - Method in class dataStructures.VectorLinearList
create and return an enumerator
empty() - Method in class dataStructures.DerivedLinkedStack
 
empty() - Method in class dataStructures.ArrayStack
 
empty() - Method in interface dataStructures.Stack
 
empty() - Method in class dataStructures.LinkedStack
 
empty() - Method in class dataStructures.DerivedArrayStack
 
empty() - Method in class dataStructures.FormulaStack
 
empty() - Method in class dataStructures.DerivedArrayStackWithCatch
 
empty() - Method in class dataStructures.DerivedVectorStack
 
empty() - Method in class dataStructures.SimulatedLinkedStack
 
empty() - Method in class dataStructures.FormulaStackWithCatch
 
empty() - Method in class dataStructures.VectorStack
 
EmptyQueueException - exception exceptions.EmptyQueueException.
 
EmptyQueueException() - Constructor for class exceptions.EmptyQueueException
 
equals(Object) - Method in class applications.ClosestPoints.Point1
 
equals(Object) - Method in class applications.ClosestPoints.Point2
 
equals(Object) - Method in class dataStructures.EdgeNode
 
equals(Object) - Method in class dataStructures.ComparableEdge
 
equals(Object) - Method in interface utilities.MyComparable
 
equals(Object) - Method in class wrappers.MyInteger
 
equals(Object) - Method in class wrappers.MyDouble
 
equalsZero() - Method in class utilities.Dummy
 
equalsZero() - Method in interface utilities.Zero
 
equalsZero() - Method in class wrappers.MyInteger
 
equalsZero() - Method in class wrappers.MyDouble
 
EvaluatePolynomial - class applications.EvaluatePolynomial.
 
EvaluatePolynomial() - Constructor for class applications.EvaluatePolynomial
 
exceptions - package exceptions
 
existsEdge(int, int) - Method in class dataStructures.Graph
 
existsEdge(int, int) - Method in class dataStructures.LinkedDigraph
 
existsEdge(int, int) - Method in interface dataStructures.Network
 
existsEdge(int, int) - Method in class dataStructures.AdjacencyDigraph
 
existsEdge(int, int) - Method in class dataStructures.AdjacencyWDigraph
 
ExtendedArrayLinearList - class dataStructures.ExtendedArrayLinearList.
 
ExtendedArrayLinearList() - Constructor for class dataStructures.ExtendedArrayLinearList
 
ExtendedArrayLinearList(int) - Constructor for class dataStructures.ExtendedArrayLinearList
 
ExtendedArrayList - class dataStructures.ExtendedArrayList.
 
ExtendedArrayList() - Constructor for class dataStructures.ExtendedArrayList
 
ExtendedArrayList(int) - Constructor for class dataStructures.ExtendedArrayList
 
ExtendedChain - class dataStructures.ExtendedChain.
 
ExtendedChain() - Constructor for class dataStructures.ExtendedChain
 
ExtendedCWTree - class dataStructures.ExtendedCWTree.
 
ExtendedCWTree() - Constructor for class dataStructures.ExtendedCWTree
 
ExtendedLinearList - interface dataStructures.ExtendedLinearList.
 

F

factorial(int) - Static method in class utilities.MyMath
 
FastArrayLinearList - class dataStructures.FastArrayLinearList.
 
FastArrayLinearList() - Constructor for class dataStructures.FastArrayLinearList
create a list with initial capacity 10
FastArrayLinearList(int) - Constructor for class dataStructures.FastArrayLinearList
create a list with initial capacity initialCapacity
fastSquareMultiply(int[][], int[][], int[][], int) - Static method in class utilities.MatrixOperations
Multiply two n x n integer matrices.
FastUnionFind - class applications.FastUnionFind.
 
FastUnionFind(int) - Constructor for class applications.FastUnionFind
initialize n trees, one element per tree/class/set
FIFOBBLoading1 - class applications.FIFOBBLoading1.
 
FIFOBBLoading1() - Constructor for class applications.FIFOBBLoading1
 
FIFOBBLoading2 - class applications.FIFOBBLoading2.
 
FIFOBBLoading2() - Constructor for class applications.FIFOBBLoading2
 
FIFOBBLoading3 - class applications.FIFOBBLoading3.
 
FIFOBBLoading3() - Constructor for class applications.FIFOBBLoading3
 
find(int) - Method in class applications.FastUnionFind
 
find(int) - Method in class applications.UnionFindWithTrees
 
findPath(int, int) - Method in class dataStructures.Graph
find a path from s to d
FirstFit - class applications.FirstFit.
 
FirstFit.Bin - class applications.FirstFit.Bin.
 
FirstFit.Bin(int) - Constructor for class applications.FirstFit.Bin
 
FirstFit() - Constructor for class applications.FirstFit
 
firstFitPack(int[], int) - Static method in class applications.FirstFit
output first fit packing into bins of size binCapacity
firstNode - Variable in class dataStructures.Chain
 
firstNode - Variable in class dataStructures.SortedChain
 
firstNode - Variable in class dataStructures.SimulatedChain
 
FloatAbc - class misc.FloatAbc.
 
FloatAbc() - Constructor for class misc.FloatAbc
 
flushCurrentLine() - Method in class utilities.MyInputStream
Discard remainder of current line.
FormulaBasedLinearList - class dataStructures.FormulaBasedLinearList.
 
FormulaBasedLinearList() - Constructor for class dataStructures.FormulaBasedLinearList
create a list with initial capacity 10
FormulaBasedLinearList(int) - Constructor for class dataStructures.FormulaBasedLinearList
create a list with initial capacity initialCapacity
FormulaBasedLinearListIterator - class dataStructures.FormulaBasedLinearListIterator.
 
FormulaBasedLinearListIterator(FormulaBasedLinearList) - Constructor for class dataStructures.FormulaBasedLinearListIterator
 
FormulaStack - class dataStructures.FormulaStack.
 
FormulaStack() - Constructor for class dataStructures.FormulaStack
create a stack with initial capacity 10
FormulaStack(int) - Constructor for class dataStructures.FormulaStack
create a stack with the given initial capacity
FormulaStackWithCatch - class dataStructures.FormulaStackWithCatch.
 
FormulaStackWithCatch() - Constructor for class dataStructures.FormulaStackWithCatch
create a stack with initial capacity 10
FormulaStackWithCatch(int) - Constructor for class dataStructures.FormulaStackWithCatch
create a stack with the given initial capacity
front - Variable in class dataStructures.LinkedQueue
 

G

GenericAbc - class misc.GenericAbc.
 
GenericAbc() - Constructor for class misc.GenericAbc
 
get(int) - Method in class dataStructures.Chain
 
get(int) - Method in class dataStructures.ArrayLinearList
 
get(int) - Method in class dataStructures.SimulatedChain
 
get(int) - Method in interface dataStructures.IndexedBSTree
 
get(int) - Method in interface dataStructures.LinearList
 
get(int) - Method in class dataStructures.LinearListAsVector
 
get(int) - Method in class dataStructures.LinearListAsAbstractClass
 
get(int) - Method in class dataStructures.ArrayLinearListWithIterator
 
get(int) - Method in class dataStructures.FastArrayLinearList
 
get(int, int) - Method in class dataStructures.Matrix
 
get(int, int) - Method in class dataStructures.TridiagonalMatrix
 
get(int, int) - Method in class dataStructures.DiagonalMatrix
 
get(int, int) - Method in class dataStructures.LowerTriangularMatrix
 
get(Object) - Method in class dataStructures.BinarySearchTree
 
get(Object) - Method in class dataStructures.SortedChain
 
get(Object) - Method in class dataStructures.HashChains
 
get(Object) - Method in interface dataStructures.Dictionary
 
get(Object) - Method in class dataStructures.HashTable
 
get(Object) - Method in class dataStructures.SkipList
 
getCents() - Method in class applications.Currency2
 
getCents() - Method in class applications.CurrencyAsLong
 
getCents() - Method in class applications.Currency
 
getDollars() - Method in class applications.Currency2
 
getDollars() - Method in class applications.CurrencyAsLong
 
getDollars() - Method in class applications.Currency
 
getElement() - Method in class dataStructures.BinaryTreeNode
 
getFrontElement() - Method in class dataStructures.LinkedQueue
 
getFrontElement() - Method in class dataStructures.ArrayQueue
 
getFrontElement() - Method in interface dataStructures.Queue
 
getGreaterThanOrEqual(Object) - Method in class dataStructures.DBinarySearchTreeWithGE
 
getLeftChild() - Method in class dataStructures.BinaryTreeNode
 
getMax() - Method in class dataStructures.MaxHeap
 
getMax() - Method in interface dataStructures.MaxPriorityQueue
 
getMax() - Method in class dataStructures.MaxHblt
 
getMin() - Method in interface dataStructures.MinPriorityQueue
 
getMin() - Method in class dataStructures.MinHeap
 
getRearElement() - Method in class dataStructures.LinkedQueue
 
getRearElement() - Method in class dataStructures.ArrayQueue
 
getRearElement() - Method in interface dataStructures.Queue
 
getRightChild() - Method in class dataStructures.BinaryTreeNode
 
getSign() - Method in class applications.Currency2
 
getSign() - Method in class applications.CurrencyAsLong
 
getSign() - Method in class applications.Currency
 
getValue() - Method in class wrappers.MyInteger
 
getValue() - Method in class wrappers.MyDouble
 
getWinner() - Method in interface dataStructures.WinnerTree
 
getWinner() - Method in class dataStructures.CompleteWinnerTree
 
getWinner(int) - Method in class dataStructures.ExtendedCWTree
 
Graph - class dataStructures.Graph.
 
Graph() - Constructor for class dataStructures.Graph
 
GraphChain - class dataStructures.GraphChain.
 
GraphChain() - Constructor for class dataStructures.GraphChain
 
greaterThan(Object) - Method in interface utilities.MyComparable
 
greaterThanOrEqual(Object) - Method in interface utilities.MyComparable
 
GreedyLoading - class applications.GreedyLoading.
 
GreedyLoading() - Constructor for class applications.GreedyLoading
 

H

HashChains - class dataStructures.HashChains.
 
HashChains(int) - Constructor for class dataStructures.HashChains
 
hashCode() - Method in class wrappers.MyInteger
 
HashTable - class dataStructures.HashTable.
 
HashTable.HashEntry - class dataStructures.HashTable.HashEntry.
 
HashTable(int) - Constructor for class dataStructures.HashTable
 
hasMoreElements() - Method in class dataStructures.FormulaBasedLinearListIterator
 
hasMoreElements() - Method in class dataStructures.ChainIterator
 
headerNode - Variable in class dataStructures.CircularWithHeader
 
headNode - Variable in class dataStructures.SkipList
 
HeapElement - class dataStructures.HeapElement.
 
HeapElement(Object, Object) - Constructor for class dataStructures.HeapElement
 
HeapSort - class applications.HeapSort.
 
HeapSort() - Constructor for class applications.HeapSort
 
heapSort(Comparable[]) - Static method in class applications.HeapSort
sort the elements a[1 : a.length - 1] using the heap sort method
height() - Method in class dataStructures.LinkedBinaryTree
 
Horner - class applications.Horner.
 
Horner() - Constructor for class applications.Horner
 
HuffmanTree - class applications.HuffmanTree.
 
HuffmanTree() - Constructor for class applications.HuffmanTree
 
huffmanTree(Operable[]) - Static method in class applications.HuffmanTree
 

I

identity() - Method in class utilities.Dummy
 
identity() - Method in interface utilities.Computable
 
identity() - Method in class wrappers.MyInteger
 
identity() - Method in class wrappers.MyDouble
 
ImageComponents - class applications.ImageComponents.
 
ImageComponents() - Constructor for class applications.ImageComponents
 
increment(Currency) - Method in class applications.Currency
 
Increment(Currency2) - Method in class applications.Currency2
return this incremented by x
increment(CurrencyAsLong) - Method in class applications.CurrencyAsLong
 
increment(Object) - Method in class dataStructures.Matrix
increment all elements of this by x
increment(Object) - Method in class utilities.Dummy
 
increment(Object) - Method in interface utilities.Computable
 
increment(Object) - Method in class wrappers.MyInteger
 
increment(Object) - Method in class wrappers.MyDouble
 
inDegree(int) - Method in class dataStructures.Graph
 
inDegree(int) - Method in class dataStructures.LinkedDigraph
 
inDegree(int) - Method in class dataStructures.LinkedGraph
 
inDegree(int) - Method in interface dataStructures.Network
 
inDegree(int) - Method in class dataStructures.AdjacencyDigraph
 
inDegree(int) - Method in class dataStructures.AdjacencyGraph
 
inDegree(int) - Method in class dataStructures.AdjacencyWDigraph
 
inDegree(int) - Method in class dataStructures.AdjacencyWGraph
 
IndexedBSTree - interface dataStructures.IndexedBSTree.
 
indexOf(Object) - Method in class dataStructures.Chain
 
indexOf(Object) - Method in class dataStructures.ArrayLinearList
 
indexOf(Object) - Method in class dataStructures.CircularWithHeader
 
indexOf(Object) - Method in class dataStructures.SimulatedChain
 
indexOf(Object) - Method in interface dataStructures.LinearList
 
indexOf(Object) - Method in class dataStructures.LinearListAsVector
 
indexOf(Object) - Method in class dataStructures.FormulaBasedLinearList
 
indexOf(Object) - Method in class dataStructures.VectorLinearList
 
indexOf(Object) - Method in class dataStructures.LinearListAsAbstractClass
 
indexOf(Object) - Method in class dataStructures.ArrayLinearListWithIterator
 
indexOf(Object) - Method in class dataStructures.FastArrayLinearList
 
inef(int[]) - Static method in class misc.InefficientPrefixSums
 
InefficientPrefixSums - class misc.InefficientPrefixSums.
 
InefficientPrefixSums() - Constructor for class misc.InefficientPrefixSums
 
infix(BinaryTreeNode) - Static method in class applications.InfixForm
 
InfixForm - class applications.InfixForm.
 
InfixForm() - Constructor for class applications.InfixForm
 
initialize(Comparable[], int) - Method in class dataStructures.MinHeap
initialize min heap to element array theHeap
initialize(Comparable[], int) - Method in class dataStructures.MaxHeap
initialize max heap to element array theHeap
initialize(Comparable[], int) - Method in class dataStructures.MaxHblt
initialize leftist tree to elements in array theElements
initialize(Playable[]) - Method in interface dataStructures.WinnerTree
 
initialize(Playable[]) - Method in class dataStructures.CompleteWinnerTree
initialize winner tree for thePlayer[1:thePlayer.length-1]
inOrder(BinaryTreeNode) - Static method in class dataStructures.BinaryTreeTraversal
inorder traversal
inOrder(Method) - Method in class dataStructures.LinkedBinaryTree
inorder traversal
inOrder(Method) - Method in interface dataStructures.BinaryTree
 
inOrderOutput() - Method in class dataStructures.LinkedBinaryTree
output elements in inorder
input(MyInputStream) - Static method in class wrappers.MyInteger
input from the given input stream
input(MyInputStream) - Static method in class wrappers.MyDouble
input from the given input stream
input(Object, MyInputStream) - Static method in class dataStructures.LinkedSparseMatrix
input a sparse matrix into this from the given input stream
input(Object, MyInputStream) - Static method in class dataStructures.SparseMatrixAsExtendedArrayLinearList
input a sparse matrix into this from the given input stream
input(Object, MyInputStream) - Static method in class dataStructures.SparseMatrixAsVector
input a sparse matrix into this from the given input stream
input(Object, MyInputStream) - Static method in class dataStructures.SparseMatrixAsExtendedArrayList
input a sparse matrix into this from the given input stream
inputArray(Class, MyInputStream) - Method in class misc.Array1D
input objects of type theClass and store in an array
inputArray(Method, MyInputStream) - Method in class misc.NewArray1D
input objects of type theClass and store in an array
Insert - class applications.Insert.
 
Insert() - Constructor for class applications.Insert
 
insert(Comparable[], int, Comparable) - Static method in class applications.Insert
insert x into the sorted array a[0:n-1] a remains sorted after the insertion
insertElementAt(Object, int) - Method in class dataStructures.FormulaBasedLinearList
Insert an element with specified index.
insertElementAt(Object, int) - Method in class dataStructures.VectorLinearList
Insert an element with specified index.
insertionSort(Comparable[]) - Static method in class applications.InsertionSort2
sort the array a using the insertion sort method
insertionSort(Comparable[]) - Static method in class applications.InsertionSort1
sort the array a using the insertion sort method
InsertionSort1 - class applications.InsertionSort1.
 
InsertionSort1() - Constructor for class applications.InsertionSort1
 
InsertionSort2 - class applications.InsertionSort2.
 
InsertionSort2() - Constructor for class applications.InsertionSort2
 
integer(String) - Static method in class dataStructures.ConvertString
covert string s into an integer that depends on all characters of s
IntegerAbc - class misc.IntegerAbc.
 
IntegerAbc() - Constructor for class misc.IntegerAbc
 
IntegerAbcWithException - class misc.IntegerAbcWithException.
 
IntegerAbcWithException() - Constructor for class misc.IntegerAbcWithException
 
intValue() - Method in class wrappers.MyInteger
 
IrregularArray - class misc.IrregularArray.
 
IrregularArray() - Constructor for class misc.IrregularArray
 
isEmpty() - Method in class dataStructures.Chain
 
isEmpty() - Method in class dataStructures.LinkedBinaryTree
 
isEmpty() - Method in class dataStructures.SortedChain
 
isEmpty() - Method in interface dataStructures.MinPriorityQueue
 
isEmpty() - Method in class dataStructures.HashChains
 
isEmpty() - Method in class dataStructures.ArrayLinearList
 
isEmpty() - Method in class dataStructures.MinHeap
 
isEmpty() - Method in class dataStructures.HashTable
 
isEmpty() - Method in class dataStructures.SimulatedChain
 
isEmpty() - Method in interface dataStructures.BinaryTree
 
isEmpty() - Method in interface dataStructures.LinearList
 
isEmpty() - Method in class dataStructures.MaxHeap
 
isEmpty() - Method in class dataStructures.LinearListAsVector
 
isEmpty() - Method in class dataStructures.FormulaBasedLinearList
 
isEmpty() - Method in interface dataStructures.MaxPriorityQueue
 
isEmpty() - Method in class dataStructures.VectorLinearList
 
isEmpty() - Method in class dataStructures.LinearListAsAbstractClass
 
isEmpty() - Method in class dataStructures.LinkedQueue
 
isEmpty() - Method in class dataStructures.ArrayQueue
 
isEmpty() - Method in interface dataStructures.Queue
 
isEmpty() - Method in class dataStructures.ArrayLinearListWithIterator
 
isEmpty() - Method in class dataStructures.MaxHblt
 
isEmpty() - Method in class dataStructures.FastArrayLinearList
 
isEmpty() - Method in class dataStructures.SkipList
 
IterativeBTLoading - class applications.IterativeBTLoading.
 
IterativeBTLoading() - Constructor for class applications.IterativeBTLoading
 
IterativeDPImageCompression - class applications.IterativeDPImageCompression.
 
IterativeDPImageCompression() - Constructor for class applications.IterativeDPImageCompression
 
IterativeDPKnapsack - class applications.IterativeDPKnapsack.
 
IterativeDPKnapsack() - Constructor for class applications.IterativeDPKnapsack
 
IterativeDPMatrixChain - class applications.IterativeDPMatrixChain.
 
IterativeDPMatrixChain() - Constructor for class applications.IterativeDPMatrixChain
 
IterativeDPNoncrossingSubset - class applications.IterativeDPNoncrossingSubset.
 
IterativeDPNoncrossingSubset() - Constructor for class applications.IterativeDPNoncrossingSubset
 
iterator() - Method in class dataStructures.Chain
create and return an iterator
iterator() - Method in class dataStructures.SortedChain
create and return an iterator
iterator() - Method in class dataStructures.ArrayLinearList
create and return an iterator
iterator() - Method in class dataStructures.ArrayLinearListWithIterator
create and return an iterator
iterator() - Method in class dataStructures.SkipList
create and return an iterator
iterator(int) - Method in class dataStructures.Graph
 
iterator(int) - Method in class dataStructures.LinkedDigraph
create and return an iterator for vertex i
iterator(int) - Method in interface dataStructures.Network
 
iterator(int) - Method in class dataStructures.AdjacencyDigraph
create and return an iterator for vertex i
iterator(int) - Method in class dataStructures.AdjacencyWDigraph
create and return an iterator for vertex i

K

key - Variable in class dataStructures.HashTable.HashEntry
 
key - Variable in class dataStructures.SortedChain.SortedChainNode
 
key - Variable in class dataStructures.SkipList.SkipNode
 
knapsack(double[], double[], double) - Static method in class applications.RecursiveBTKnapsack
 
knapsack(double[], double[], double, int[]) - Static method in class applications.MaxProfitBBKnapsack
 
knapsack(int[], int[], int) - Static method in class applications.RecursiveDPKnapsack
set class data members and invoke method f
knapsack(int[], int[], int) - Static method in class applications.RecursiveDPKnapsack3
set class data members and invoke method f
knapsack(int[], int[], int, int[][]) - Static method in class applications.IterativeDPKnapsack
iterative method to solve dynamic programming recurrence computes f[1][c] and f[i][y], 2 <= i <= numberOfObjects, 0 <= y <= knapsackCapacity
kruskal(WeightedEdge[]) - Method in class dataStructures.Graph
find a min cost spanning tree using Kruskal's method

L

labelComponents(int[]) - Method in class dataStructures.Graph
label the components of an undirected graph
last - Variable in class dataStructures.SkipList
 
lastNode - Variable in class dataStructures.ExtendedChain
 
LeastCostBBBoard - class applications.LeastCostBBBoard.
 
LeastCostBBBoard() - Constructor for class applications.LeastCostBBBoard
 
leastCostBBBoards(int[][], int, int[]) - Static method in class applications.LeastCostBBBoard
least-cost branch-and-bound code
leastCostBBSalesperson(int[], Operable) - Method in class dataStructures.AdjacencyWDigraph
least-cost branch-and-bound code to find a shortest tour
lessThan(Object) - Method in interface utilities.MyComparable
 
lessThanOrEqual(Object) - Method in interface utilities.MyComparable
 
levelOrder(BinaryTreeNode) - Static method in class dataStructures.BinaryTreeTraversal
level order traversal
levelOrder(Method) - Method in class dataStructures.LinkedBinaryTree
level order traversal
levelOrder(Method) - Method in interface dataStructures.BinaryTree
 
levelOrderOutput() - Method in class dataStructures.LinkedBinaryTree
output elements in level order
levels - Variable in class dataStructures.SkipList
 
LinearList - interface dataStructures.LinearList.
 
LinearListAsAbstractClass - class dataStructures.LinearListAsAbstractClass.
 
LinearListAsAbstractClass() - Constructor for class dataStructures.LinearListAsAbstractClass
 
LinearListAsVector - class dataStructures.LinearListAsVector.
 
LinearListAsVector() - Constructor for class dataStructures.LinearListAsVector
create a list with initial capacity 10
LinearListAsVector(int) - Constructor for class dataStructures.LinearListAsVector
create a list with initial capacity initialCapacity
LinearListAsVectorSubclass - class dataStructures.LinearListAsVectorSubclass.
 
LinearListAsVectorSubclass() - Constructor for class dataStructures.LinearListAsVectorSubclass
 
LinearListAsVectorSubclass(int) - Constructor for class dataStructures.LinearListAsVectorSubclass
 
LinkedBinaryTree - class dataStructures.LinkedBinaryTree.
 
LinkedBinaryTree() - Constructor for class dataStructures.LinkedBinaryTree
 
LinkedDigraph - class dataStructures.LinkedDigraph.
 
LinkedDigraph() - Constructor for class dataStructures.LinkedDigraph
 
LinkedDigraph(int) - Constructor for class dataStructures.LinkedDigraph
 
LinkedGraph - class dataStructures.LinkedGraph.
 
LinkedGraph() - Constructor for class dataStructures.LinkedGraph
 
LinkedGraph(int) - Constructor for class dataStructures.LinkedGraph
 
LinkedQueue - class dataStructures.LinkedQueue.
 
LinkedQueue() - Constructor for class dataStructures.LinkedQueue
 
LinkedQueue(int) - Constructor for class dataStructures.LinkedQueue
create an empty queue
LinkedSparseMatrix - class dataStructures.LinkedSparseMatrix.
 
LinkedSparseMatrix(int, int, int, Object) - Constructor for class dataStructures.LinkedSparseMatrix
 
LinkedSparseMatrix(int, int, Object) - Constructor for class dataStructures.LinkedSparseMatrix
use a default estimated maximum size of 1
LinkedSparseMatrix(Object) - Constructor for class dataStructures.LinkedSparseMatrix
defaults are rows = cols = estimatedMaxSize = 1
LinkedStack - class dataStructures.LinkedStack.
 
LinkedStack() - Constructor for class dataStructures.LinkedStack
 
LinkedStack(int) - Constructor for class dataStructures.LinkedStack
create an empty stack
LinkedWDigraph - class dataStructures.LinkedWDigraph.
 
LinkedWDigraph() - Constructor for class dataStructures.LinkedWDigraph
 
LinkedWDigraph(int) - Constructor for class dataStructures.LinkedWDigraph
 
LinkedWGraph - class dataStructures.LinkedWGraph.
 
LinkedWGraph() - Constructor for class dataStructures.LinkedWGraph
 
LinkedWGraph(int) - Constructor for class dataStructures.LinkedWGraph
 
LowerTriangularMatrix - class dataStructures.LowerTriangularMatrix.
 
LowerTriangularMatrix(int, Object) - Constructor for class dataStructures.LowerTriangularMatrix
 
LPTSchedule - class applications.LPTSchedule.
 
LPTSchedule() - Constructor for class applications.LPTSchedule
 

M

MachineShopSimulator - class applications.MachineShopSimulator.
 
MachineShopSimulator() - Constructor for class applications.MachineShopSimulator
 
main(String[]) - Static method in class applications.HuffmanTree
test program
main(String[]) - Static method in class applications.RailroadWithQueues
test program
main(String[]) - Static method in class applications.RecursiveDPImageCompression1
driver program
main(String[]) - Static method in class applications.MinMax3
test program
main(String[]) - Static method in class applications.Compress
 
main(String[]) - Static method in class applications.OfflineEquivalenceClasses
input the relation pairs and output the classes
main(String[]) - Static method in class applications.Horner
test program
main(String[]) - Static method in class applications.Chessboard
test tileBoard
main(String[]) - Static method in class applications.EarlyTerminatingSelectionSort
test program
main(String[]) - Static method in class applications.RecursiveBTLoading3
test program
main(String[]) - Static method in class applications.MaxProfitBBLoading
test program
main(String[]) - Static method in class applications.RecursiveBTBoard
test program
main(String[]) - Static method in class applications.ClosestPoints
test program
main(String[]) - Static method in class applications.PlaceBoosters
test program
main(String[]) - Static method in class applications.RankSort2
test program
main(String[]) - Static method in class applications.FIFOBBLoading1
test program
main(String[]) - Static method in class applications.LPTSchedule
test program
main(String[]) - Static method in class applications.MachineShopSimulator
entry point for machine shop simulator
main(String[]) - Static method in class applications.IterativeDPMatrixChain
driver program
main(String[]) - Static method in class applications.LeastCostBBBoard
test program
main(String[]) - Static method in class applications.RecursiveSequentialSearch
test program
main(String[]) - Static method in class applications.RailroadWithNoQueues
test program
main(String[]) - Static method in class applications.BubbleSort
test program
main(String[]) - Static method in class applications.QuadraticRoots
test program
main(String[]) - Static method in class applications.InsertionSort2
test program
main(String[]) - Static method in class applications.Select
test program
main(String[]) - Static method in class applications.Rank
test program
main(String[]) - Static method in class applications.EarlyTerminatingBubbleSort
test program
main(String[]) - Static method in class applications.ParenthesisMatching
test program
main(String[]) - Static method in class applications.ChainWithBinSort
test program
main(String[]) - Static method in class applications.RecursiveBTKnapsack
test program
main(String[]) - Static method in class applications.ImageComponents
entry point for component labeling program
main(String[]) - Static method in class applications.Currency2
test program
main(String[]) - Static method in class applications.MinMax2
test program
main(String[]) - Static method in class applications.RecursiveDPKnapsack
test program
main(String[]) - Static method in class applications.Permutation
test perm
main(String[]) - Static method in class applications.RecursiveDPMatrixChain2
driver program
main(String[]) - Static method in class applications.TreeHistogramming
histogram using a search tree
main(String[]) - Static method in class applications.RecursiveBTLoading2
test program
main(String[]) - Static method in class applications.CurrencyAsLong
test program
main(String[]) - Static method in class applications.QuickSort
test program
main(String[]) - Static method in class applications.RatInAMaze
entry point for rat in a maze program
main(String[]) - Static method in class applications.BinSort
test program
main(String[]) - Static method in class applications.RankSort1
test program
main(String[]) - Static method in class applications.BestFit
test program
main(String[]) - Static method in class applications.EvaluatePolynomial
test program
main(String[]) - Static method in class applications.HeapSort
test program
main(String[]) - Static method in class applications.FIFOBBLoading3
test program
main(String[]) - Static method in class applications.FastUnionFind
test program
main(String[]) - Static method in class applications.InsertionSort1
test program
main(String[]) - Static method in class applications.TowersOfHanoi
test program
main(String[]) - Static method in class applications.UnionFindFirstSolution
test program
main(String[]) - Static method in class applications.IterativeDPNoncrossingSubset
driver program
main(String[]) - Static method in class applications.WireRouter
entry point for wire routing program
main(String[]) - Static method in class applications.IterativeDPKnapsack
test program
main(String[]) - Static method in class applications.MergeSort
test program
main(String[]) - Static method in class applications.TowersOfHanoiShowingStates
test program
main(String[]) - Static method in class applications.SequentialSearch2
test program
main(String[]) - Static method in class applications.FirstFit
test program
main(String[]) - Static method in class applications.MaxProfitBBKnapsack
test program
main(String[]) - Static method in class applications.IterativeBTLoading
test program
main(String[]) - Static method in class applications.MinMax1
test program
main(String[]) - Static method in class applications.Currency
test program
main(String[]) - Static method in class applications.RecursiveDPMatrixChain1
driver program
main(String[]) - Static method in class applications.RecursiveBTLoading1
test program
main(String[]) - Static method in class applications.RecursiveDPImageCompression2
driver program
main(String[]) - Static method in class applications.RecursiveSum
test program
main(String[]) - Static method in class applications.UnionFindWithTrees
test program
main(String[]) - Static method in class applications.SwitchBox
test program
main(String[]) - Static method in class applications.Insert
test program
main(String[]) - Static method in class applications.ConvertSortTimes
 
main(String[]) - Static method in class applications.GreedyLoading
test method
main(String[]) - Static method in class applications.FIFOBBLoading2
test program
main(String[]) - Static method in class applications.InfixForm
test program
main(String[]) - Static method in class applications.SelectionSort
test program
main(String[]) - Static method in class applications.IterativeDPImageCompression
driver program
main(String[]) - Static method in class applications.RailroadWithStacks
test program
main(String[]) - Static method in class applications.UnionFindSecondSolution
test program
main(String[]) - Static method in class applications.SimpleHistogramming
 
main(String[]) - Static method in class applications.RecursiveDPKnapsack3
test program
main(String[]) - Static method in class applications.Decompress
 
main(String[]) - Static method in class applications.CrossingDistribution
 
main(String[]) - Static method in class applications.SequentialSearch1
test program
main(String[]) - Static method in class applications.BinarySearch
test program
main(String[]) - Static method in class dataStructures.Chain
test program
main(String[]) - Static method in class dataStructures.LinkedBinaryTree
test program
main(String[]) - Static method in class dataStructures.BinarySearchTree
 
main(String[]) - Static method in class dataStructures.Matrix
test program
main(String[]) - Static method in class dataStructures.LinkedSparseMatrix
test program
main(String[]) - Static method in class dataStructures.SortedChain
test program
main(String[]) - Static method in class dataStructures.SortedChainWithDuplicates
test program
main(String[]) - Static method in class dataStructures.TestKruskal
 
main(String[]) - Static method in class dataStructures.LinkedDigraph
test program
main(String[]) - Static method in class dataStructures.LinkedGraph
test program
main(String[]) - Static method in class dataStructures.LinkedWGraph
test program
main(String[]) - Static method in class dataStructures.FormulaBasedLinearListIterator
test program
main(String[]) - Static method in class dataStructures.HashChains
test method
main(String[]) - Static method in class dataStructures.TridiagonalMatrix
test program
main(String[]) - Static method in class dataStructures.DBinarySearchTree
 
main(String[]) - Static method in class dataStructures.DiagonalMatrix
test program
main(String[]) - Static method in class dataStructures.DerivedLinkedStack
test program
main(String[]) - Static method in class dataStructures.TestBTMaxClique
 
main(String[]) - Static method in class dataStructures.ArrayLinearList
test program
main(String[]) - Static method in class dataStructures.TestBipartiteCover
 
main(String[]) - Static method in class dataStructures.ArrayStack
test program
main(String[]) - Static method in class dataStructures.CircularWithHeader
test program
main(String[]) - Static method in class dataStructures.TestLabelComponents
 
main(String[]) - Static method in class dataStructures.TestFindPath
 
main(String[]) - Static method in class dataStructures.MinHeap
test program
main(String[]) - Static method in class dataStructures.TestBellmanFord
 
main(String[]) - Static method in class dataStructures.test
 
main(String[]) - Static method in class dataStructures.HashTable
test method
main(String[]) - Static method in class dataStructures.SimulatedChain
test program
main(String[]) - Static method in class dataStructures.LinkedStack
test program
main(String[]) - Static method in class dataStructures.DerivedArrayStack
test program
main(String[]) - Static method in class dataStructures.LowerTriangularMatrix
test program
main(String[]) - Static method in class dataStructures.CompleteWinnerTree
test program
main(String[]) - Static method in class dataStructures.TestLeastCostBBSalesperson
 
main(String[]) - Static method in class dataStructures.ChainWithBinSort
test program
main(String[]) - Static method in class dataStructures.AdjacencyDigraph
test program
main(String[]) - Static method in class dataStructures.AdjacencyGraph
test program for basic graph methods
main(String[]) - Static method in class dataStructures.TestTopologicalOrder
 
main(String[]) - Static method in class dataStructures.MaxHeap
test program
main(String[]) - Static method in class dataStructures.SimulatedSpace2
test program
main(String[]) - Static method in class dataStructures.TestBTSalesperson
 
main(String[]) - Static method in class dataStructures.LinearListAsVector
test program
main(String[]) - Static method in class dataStructures.ChainIterator
test program
main(String[]) - Static method in class dataStructures.FormulaBasedLinearList
test program
main(String[]) - Static method in class dataStructures.FormulaStack
test program
main(String[]) - Static method in class dataStructures.AdjacencyWDigraph
test program for Graph methods
main(String[]) - Static method in class dataStructures.TestAllPairs
 
main(String[]) - Static method in class dataStructures.VectorLinearList
test program
main(String[]) - Static method in class dataStructures.DerivedArrayStackWithCatch
test program
main(String[]) - Static method in class dataStructures.SparseMatrixAsExtendedArrayLinearList
test program
main(String[]) - Static method in class dataStructures.DerivedVectorStack
test program
main(String[]) - Static method in class dataStructures.LinkedQueue
test program
main(String[]) - Static method in class dataStructures.TestConnected
 
main(String[]) - Static method in class dataStructures.ArrayQueue
test program
main(String[]) - Static method in class dataStructures.TestGraphSearchMethods
 
main(String[]) - Static method in class dataStructures.ExtendedChain
test program
main(String[]) - Static method in class dataStructures.SimulatedLinkedStack
test program
main(String[]) - Static method in class dataStructures.SparseMatrixAsVector
test program
main(String[]) - Static method in class dataStructures.ArrayLinearListWithIterator
test program
main(String[]) - Static method in class dataStructures.AdjacencyWGraph
test program
main(String[]) - Static method in class dataStructures.SimulatedSpace1
test program
main(String[]) - Static method in class dataStructures.TestShortestPaths
 
main(String[]) - Static method in class dataStructures.FormulaStackWithCatch
test program
main(String[]) - Static method in class dataStructures.ConvertString
test program
main(String[]) - Static method in class dataStructures.VectorStack
test program
main(String[]) - Static method in class dataStructures.SparseMatrixAsExtendedArrayList
test program
main(String[]) - Static method in class dataStructures.MaxHblt
test program
main(String[]) - Static method in class dataStructures.FastArrayLinearList
test program
main(String[]) - Static method in class dataStructures.LinkedWDigraph
test program
main(String[]) - Static method in class dataStructures.SkipList
test program
main(String[]) - Static method in class dataStructures.TestMaxProfitBBMaxClique
 
main(String[]) - Static method in class dataStructures.LinearListAsVectorSubclass
test program
main(String[]) - Static method in class dataStructures.BinaryTreeTraversal
test program
main(String[]) - Static method in class misc.TimeDerivedVectorStack
 
main(String[]) - Static method in class misc.TimeBFS
 
main(String[]) - Static method in class misc.IntegerAbcWithException
 
main(String[]) - Static method in class misc.SumStepCount1
test program
main(String[]) - Static method in class misc.SumStepCount2
test program
main(String[]) - Static method in class misc.TimeSimulatedChain
 
main(String[]) - Static method in class misc.TimeDerivedLinkedStack
 
main(String[]) - Static method in class misc.TimeDerivedArrayStack
 
main(String[]) - Static method in class misc.TimeFastArrayLinearList
 
main(String[]) - Static method in class misc.UsingAVector
 
main(String[]) - Static method in class misc.Abc
 
main(String[]) - Static method in class misc.Array1D
test inputArray
main(String[]) - Static method in class misc.TimeSimulatedLinkedStack
 
main(String[]) - Static method in class misc.TimeChain
 
main(String[]) - Static method in class misc.TimeVectorStack
 
main(String[]) - Static method in class misc.TimeArrayStack
 
main(String[]) - Static method in class misc.TimeFormulaStackWithCatch
 
main(String[]) - Static method in class misc.TimeSparseMatrixAsVector
 
main(String[]) - Static method in class misc.AverageSortTime
 
main(String[]) - Static method in class misc.AB
 
main(String[]) - Static method in class misc.IntegerAbc
 
main(String[]) - Static method in class misc.IrregularArray
 
main(String[]) - Static method in class misc.TimeArrayLinearList
 
main(String[]) - Static method in class misc.FloatAbc
 
main(String[]) - Static method in class misc.TimeLinkedStack
 
main(String[]) - Static method in class misc.TimeLinearListAsVector
 
main(String[]) - Static method in class misc.RecursiveSumStepCount
test program
main(String[]) - Static method in class misc.TimeStack
 
main(String[]) - Static method in class misc.D
 
main(String[]) - Static method in class misc.TimeSparseMatrixAsExtendedArrayLinearList
 
main(String[]) - Static method in class misc.NewArray1D
test inputArray
main(String[]) - Static method in class misc.InefficientPrefixSums
 
main(String[]) - Static method in class misc.TimeOverhead
 
main(String[]) - Static method in class misc.TimeFormulaStack
 
main(String[]) - Static method in class misc.MakeData
 
main(String[]) - Static method in class misc.TimeMatrixMultiply
 
main(String[]) - Static method in class misc.NoSwap
 
main(String[]) - Static method in class misc.TimeLinearListAsVectorSubclass
 
main(String[]) - Static method in class misc.TimeSparseMatrixAsExtendedArrayList
 
main(String[]) - Static method in class misc.MatrixAddStepCount1
 
main(String[]) - Static method in class misc.TimeMatrix
 
main(String[]) - Static method in class misc.GenericAbc
 
main(String[]) - Static method in class misc.TimeArrayList
 
main(String[]) - Static method in class misc.MatrixAddStepCount2
 
main(String[]) - Static method in class misc.TimeInsertionSort1
 
main(String[]) - Static method in class misc.TimeLinkedList
 
main(String[]) - Static method in class misc.Welcome
 
main(String[]) - Static method in class misc.TimeDerivedArrayStackWithCatch
 
main(String[]) - Static method in class misc.TimeInsertionSort2
 
main(String[]) - Static method in class misc.TimeInsertionSort3
 
main(String[]) - Static method in class misc.TimeInsertionSort4
 
main(String[]) - Static method in class utilities.test
 
main(String[]) - Static method in class utilities.MatrixOperations
 
main(String[]) - Static method in class utilities.MyMath
Test integer MyMath methods.
main(String[]) - Static method in class utilities.MyInputStream
test program
main(String[]) - Static method in class utilities.ChangeArrayLength
test program
main(String[]) - Static method in class utilities.ChangeArraySize
test program
main(String[]) - Static method in class wrappers.MyInteger
test program
main(String[]) - Static method in class wrappers.MyDouble
test program
MakeData - class misc.MakeData.
 
MakeData() - Constructor for class misc.MakeData
 
makeSchedule(LPTSchedule.JobNode[], int) - Static method in class applications.LPTSchedule
Output an m machine LPT schedule for the a.length jobs whose times are a[1:a.length-1].
makeTree(Object, Object, Object) - Method in class dataStructures.LinkedBinaryTree
set this to the tree with the given root and subtrees CAUTION: does not clone left and right
makeTree(Object, Object, Object) - Method in interface dataStructures.BinaryTree
 
Matrix - class dataStructures.Matrix.
 
Matrix(int, int) - Constructor for class dataStructures.Matrix
 
MatrixAddStepCount1 - class misc.MatrixAddStepCount1.
 
MatrixAddStepCount1() - Constructor for class misc.MatrixAddStepCount1
 
MatrixAddStepCount2 - class misc.MatrixAddStepCount2.
 
MatrixAddStepCount2() - Constructor for class misc.MatrixAddStepCount2
 
matrixChain(int[], int[][]) - Static method in class applications.RecursiveDPMatrixChain2
set class data members and invoke method c
matrixChain(int[], int[][]) - Static method in class applications.RecursiveDPMatrixChain1
set class data members and invoke method c
matrixChain(int[], int[][], int[][]) - Static method in class applications.IterativeDPMatrixChain
compute costs and kay for all Mij's iteratively
MatrixOperations - class utilities.MatrixOperations.
 
MatrixOperations() - Constructor for class utilities.MatrixOperations
 
max - Variable in class applications.MinMaxPair
 
max(Comparable[], int) - Static method in class utilities.MyMath
generic method to find maximum object in a[0:n]
MaxHblt - class dataStructures.MaxHblt.
 
MaxHblt() - Constructor for class dataStructures.MaxHblt
 
MaxHeap - class dataStructures.MaxHeap.
 
MaxHeap() - Constructor for class dataStructures.MaxHeap
create a heap with initial capacity 10
MaxHeap(int) - Constructor for class dataStructures.MaxHeap
create a heap with the given initial capacity
maxLevel - Variable in class dataStructures.SkipList
 
maxLoading(int[], int) - Static method in class applications.FIFOBBLoading1
FIFO branch-and-bound search of solution space
maxLoading(int[], int) - Static method in class applications.RecursiveBTLoading2
 
maxLoading(int[], int) - Static method in class applications.RecursiveBTLoading1
 
maxLoading(int[], int) - Static method in class applications.FIFOBBLoading2
FIFO branch-and-bound search of solution space
maxLoading(int[], int, int[]) - Static method in class applications.RecursiveBTLoading3
 
maxLoading(int[], int, int[]) - Static method in class applications.MaxProfitBBLoading
max profit branch-and-bound search of solution space
maxLoading(int[], int, int[]) - Static method in class applications.FIFOBBLoading3
FIFO branch-and-bound search of solution space
maxLoading(int[], int, int[]) - Static method in class applications.IterativeBTLoading
 
MaxPriorityQueue - interface dataStructures.MaxPriorityQueue.
 
MaxProfitBBKnapsack - class applications.MaxProfitBBKnapsack.
 
MaxProfitBBKnapsack() - Constructor for class applications.MaxProfitBBKnapsack
 
MaxProfitBBLoading - class applications.MaxProfitBBLoading.
 
MaxProfitBBLoading() - Constructor for class applications.MaxProfitBBLoading
 
maxProfitBBMaxClique(int[]) - Method in class dataStructures.AdjacencyGraph
max-profit branch-and-bound code to find a max clique
meld(MaxHblt) - Method in class dataStructures.MaxHblt
meld the max leftist trees this and x on exit, this is the result
merge(Comparable[], Comparable[], int, int, int) - Static method in class applications.MergeSort
merge two adjacent segments from c to d
mergePass(Comparable[], Comparable[], int) - Static method in class applications.MergeSort
merge adjacent segments from x to y
MergeSort - class applications.MergeSort.
 
MergeSort() - Constructor for class applications.MergeSort
 
mergeSort(Comparable[]) - Static method in class applications.MergeSort
sort the elements a[0 : a.length - 1] using the merge sort method
min - Variable in class applications.MinMaxPair
 
MinHeap - class dataStructures.MinHeap.
 
MinHeap() - Constructor for class dataStructures.MinHeap
create a heap with initial capacity 10
MinHeap(int) - Constructor for class dataStructures.MinHeap
create a heap with the given initial capacity
minMax(Comparable[]) - Static method in class applications.MinMax3
 
minMax(Comparable[]) - Static method in class applications.MinMax2
 
minMax(Comparable[]) - Static method in class applications.MinMax1
 
MinMax1 - class applications.MinMax1.
 
MinMax1() - Constructor for class applications.MinMax1
 
MinMax2 - class applications.MinMax2.
 
MinMax2() - Constructor for class applications.MinMax2
 
MinMax3 - class applications.MinMax3.
 
MinMax3() - Constructor for class applications.MinMax3
 
MinMaxPair - class applications.MinMaxPair.
 
MinMaxPair(int, int) - Constructor for class applications.MinMaxPair
 
MinPriorityQueue - interface dataStructures.MinPriorityQueue.
 
MINUS - Static variable in class applications.Currency2
 
MINUS - Static variable in class applications.CurrencyAsLong
 
MINUS - Static variable in class applications.Currency
 
misc - package misc
 
mns(int[], int[][]) - Static method in class applications.IterativeDPNoncrossingSubset
compute size[i][j] for all i and j
mod(Object) - Method in class utilities.Dummy
 
mod(Object) - Method in interface utilities.Computable
 
mod(Object) - Method in class wrappers.MyInteger
 
mod(Object) - Method in class wrappers.MyDouble
 
multiply(int[][], int[][], int[][], int, int, int) - Static method in class utilities.MatrixOperations
Multiply the m x n integer matrix a and the n x p integer matrix b to get the m x p integer matrix c.
multiply(Matrix) - Method in class dataStructures.Matrix
 
multiply(Object) - Method in class utilities.Dummy
 
multiply(Object) - Method in interface utilities.Computable
 
multiply(Object) - Method in class wrappers.MyInteger
 
multiply(Object) - Method in class wrappers.MyDouble
 
MyComparable - interface utilities.MyComparable.
Interface to be implemented by all classes that permit comparison between their objects.
MyDouble - class wrappers.MyDouble.
 
MyDouble() - Constructor for class wrappers.MyDouble
MyDouble initialized to 0
MyDouble(double) - Constructor for class wrappers.MyDouble
MyDouble initialized to theValue
MyDouble(String) - Constructor for class wrappers.MyDouble
MyDouble initialized to s
MyInputException - exception exceptions.MyInputException.
 
MyInputException() - Constructor for class exceptions.MyInputException
 
MyInputException(String) - Constructor for class exceptions.MyInputException
 
MyInputStream - class utilities.MyInputStream.
 
MyInputStream() - Constructor for class utilities.MyInputStream
Constructor to set up BufferedReader for standard input stream System.in.
MyInputStream(String) - Constructor for class utilities.MyInputStream
Constructor to set up BufferedReader for input from a file.
MyInteger - class wrappers.MyInteger.
 
MyInteger() - Constructor for class wrappers.MyInteger
MyInteger initialized to 0
MyInteger(int) - Constructor for class wrappers.MyInteger
MyInteger initialized to theValue
MyInteger(String) - Constructor for class wrappers.MyInteger
MyInteger initialized to s
MyMath - class utilities.MyMath.
 
MyMath() - Constructor for class utilities.MyMath
 

N

Network - interface dataStructures.Network.
 
NewArray1D - class misc.NewArray1D.
 
NewArray1D() - Constructor for class misc.NewArray1D
 
next - Variable in class dataStructures.SortedChain.SortedChainNode
 
next - Variable in class dataStructures.SkipList.SkipNode
 
nextElement() - Method in class dataStructures.FormulaBasedLinearListIterator
 
nextElement() - Method in class dataStructures.ChainIterator
 
NoSwap - class misc.NoSwap.
 
NoSwap() - Constructor for class misc.NoSwap
 

O

OfflineEquivalenceClasses - class applications.OfflineEquivalenceClasses.
 
OfflineEquivalenceClasses() - Constructor for class applications.OfflineEquivalenceClasses
 
Operable - interface utilities.Operable.
 
outDegree(int) - Method in class dataStructures.Graph
 
outDegree(int) - Method in class dataStructures.LinkedDigraph
 
outDegree(int) - Method in class dataStructures.LinkedGraph
 
outDegree(int) - Method in interface dataStructures.Network
 
outDegree(int) - Method in class dataStructures.AdjacencyDigraph
 
outDegree(int) - Method in class dataStructures.AdjacencyGraph
 
outDegree(int) - Method in class dataStructures.AdjacencyWDigraph
 
outDegree(int) - Method in class dataStructures.AdjacencyWGraph
 
output() - Method in class dataStructures.LinkedDigraph
output the graph
output() - Method in class dataStructures.HashChains
output the hash table
output() - Method in class dataStructures.HashTable
output the hash table
output() - Method in class dataStructures.CompleteWinnerTree
 
output() - Method in class dataStructures.AdjacencyDigraph
output the adjacency matrix
output() - Method in class dataStructures.AdjacencyWDigraph
output the adjacency matrix
output(BinaryTreeNode) - Static method in class dataStructures.LinkedBinaryTree
visit method that outputs element
outputBoard(int) - Method in class applications.Chessboard
output the tiled chessboard
outputPath(int[][], int, int) - Static method in class dataStructures.TestAllPairs
actual code to output i to j path
outputPath(Operable[][], int[][], int, int) - Static method in class dataStructures.TestAllPairs
output shortest path from i to j
outputRoots(double, double, double) - Static method in class applications.QuadraticRoots
The quadratic is ax^2 + bx + c.

P

ParenthesisMatching - class applications.ParenthesisMatching.
 
ParenthesisMatching() - Constructor for class applications.ParenthesisMatching
 
peek() - Method in class dataStructures.DerivedLinkedStack
 
peek() - Method in class dataStructures.ArrayStack
 
peek() - Method in interface dataStructures.Stack
 
peek() - Method in class dataStructures.LinkedStack
 
peek() - Method in class dataStructures.DerivedArrayStack
 
peek() - Method in class dataStructures.FormulaStack
 
peek() - Method in class dataStructures.DerivedArrayStackWithCatch
 
peek() - Method in class dataStructures.DerivedVectorStack
 
peek() - Method in class dataStructures.SimulatedLinkedStack
 
peek() - Method in class dataStructures.FormulaStackWithCatch
 
peek() - Method in class dataStructures.VectorStack
 
perm(Object[], int, int) - Static method in class applications.Permutation
perm(x, 0, n) outputs all permutations of x[0:n]
Permutation - class applications.Permutation.
 
Permutation() - Constructor for class applications.Permutation
 
PlaceBoosters - class applications.PlaceBoosters.
 
PlaceBoosters() - Constructor for class applications.PlaceBoosters
 
placeBoosters(BinaryTreeNode) - Static method in class applications.PlaceBoosters
visit method to place boosters
Playable - interface dataStructures.Playable.
 
Player - class dataStructures.Player.
 
Player(int, int) - Constructor for class dataStructures.Player
 
PLUS - Static variable in class applications.Currency2
 
PLUS - Static variable in class applications.CurrencyAsLong
 
PLUS - Static variable in class applications.Currency
 
pop() - Method in class dataStructures.DerivedLinkedStack
remove top element of stack and return it
pop() - Method in class dataStructures.ArrayStack
remove top element of stack and return it
pop() - Method in interface dataStructures.Stack
 
pop() - Method in class dataStructures.LinkedStack
remove top element of stack and return it
pop() - Method in class dataStructures.DerivedArrayStack
remove top element of stack and return it
pop() - Method in class dataStructures.FormulaStack
remove top element of stack and return it
pop() - Method in class dataStructures.DerivedArrayStackWithCatch
remove top element of stack and return it
pop() - Method in class dataStructures.DerivedVectorStack
remove top element of stack and return it
pop() - Method in class dataStructures.SimulatedLinkedStack
remove top element of stack and return it
pop() - Method in class dataStructures.FormulaStackWithCatch
remove top element of stack and return it
pop() - Method in class dataStructures.VectorStack
remove top element of stack and return it
postOrder(BinaryTreeNode) - Static method in class dataStructures.BinaryTreeTraversal
postorder traversal
postOrder(Method) - Method in class dataStructures.LinkedBinaryTree
postorder traversal
postOrder(Method) - Method in interface dataStructures.BinaryTree
 
postOrderOutput() - Method in class dataStructures.LinkedBinaryTree
output elements in postorder
preOrder(BinaryTreeNode) - Static method in class dataStructures.BinaryTreeTraversal
preorder traversal
preOrder(Method) - Method in class dataStructures.LinkedBinaryTree
preorder traversal
preOrder(Method) - Method in interface dataStructures.BinaryTree
 
preOrderOutput() - Method in class dataStructures.LinkedBinaryTree
output elements in preorder
printMatchedPairs(String) - Static method in class applications.ParenthesisMatching
output the matched parenthesis pairs in the string expr
prob - Variable in class dataStructures.SkipList
 
push(Object) - Method in class dataStructures.DerivedLinkedStack
add theElement to the top of the stack
push(Object) - Method in class dataStructures.ArrayStack
add theElement to the top of the stack
push(Object) - Method in interface dataStructures.Stack
 
push(Object) - Method in class dataStructures.LinkedStack
add theElement to the top of the stack
push(Object) - Method in class dataStructures.DerivedArrayStack
add theElement to the top of the stack
push(Object) - Method in class dataStructures.FormulaStack
add theElement to the top of the stack
push(Object) - Method in class dataStructures.DerivedArrayStackWithCatch
add theElement to the top of the stack
push(Object) - Method in class dataStructures.DerivedVectorStack
add theElement to the top of the stack
push(Object) - Method in class dataStructures.SimulatedLinkedStack
add theElement to the top of the stack
push(Object) - Method in class dataStructures.FormulaStackWithCatch
add theElement to the top of the stack
push(Object) - Method in class dataStructures.VectorStack
add theElement to the top of the stack
put(Comparable) - Method in interface dataStructures.MinPriorityQueue
 
put(Comparable) - Method in class dataStructures.MinHeap
put theElement into the heap
put(Comparable) - Method in class dataStructures.MaxHeap
put theElement into the heap
put(Comparable) - Method in interface dataStructures.MaxPriorityQueue
 
put(Comparable) - Method in class dataStructures.MaxHblt
put theElement into the leftist tree
put(Object) - Method in class dataStructures.LinkedQueue
insert theElement at the rear of the queue
put(Object) - Method in class dataStructures.ArrayQueue
insert theElement at the rear of the queue
put(Object) - Method in interface dataStructures.Queue
 
put(Object, Object) - Method in class dataStructures.BinarySearchTree
insert an element with the specified key overwrite old element if there is already an element with the given key
put(Object, Object) - Method in class dataStructures.SortedChain
insert an element with the specified key overwrite old element if there is already an element with the given key
put(Object, Object) - Method in class dataStructures.SortedChainWithDuplicates
insert an element with the specified key overrides insert method of SortedChain which does not permit duplicate keys
put(Object, Object) - Method in class dataStructures.HashChains
insert an element with the specified key overwrite old element if there is already an element with the given key
put(Object, Object) - Method in class dataStructures.DBinarySearchTree
insert an element with the specified key overrides BinarySearchTree.put
put(Object, Object) - Method in interface dataStructures.Dictionary
 
put(Object, Object) - Method in class dataStructures.HashTable
insert an element with the specified key overwrite old element if there is already an element with the given key
put(Object, Object) - Method in class dataStructures.SkipList
insert an element with the specified key overwrite old element if there is already an element with the given key
put(Object, Object, Method) - Method in class dataStructures.BinarySearchTreeWithVisit
insert an element with the specified key if there is already an element with this key, simply visit the element
putEdge(Object) - Method in class dataStructures.Graph
 
putEdge(Object) - Method in class dataStructures.LinkedDigraph
put theEdge into the digraph
putEdge(Object) - Method in class dataStructures.LinkedGraph
put theEdge into the digraph
putEdge(Object) - Method in class dataStructures.LinkedWGraph
put theEdge into the graph
putEdge(Object) - Method in interface dataStructures.Network
 
putEdge(Object) - Method in class dataStructures.AdjacencyDigraph
put edge e into the digraph
putEdge(Object) - Method in class dataStructures.AdjacencyGraph
put edge e into the graph
putEdge(Object) - Method in class dataStructures.AdjacencyWDigraph
put edge e into the digraph; if the edge is already there, update its weight to e.weight
putEdge(Object) - Method in class dataStructures.AdjacencyWGraph
put edge e into the graph, if the edge is already there, update its weight to e.weight
putEdge(Object) - Method in class dataStructures.LinkedWDigraph
put theEdge into the digraph

Q

QuadraticRoots - class applications.QuadraticRoots.
 
QuadraticRoots() - Constructor for class applications.QuadraticRoots
 
Queue - interface dataStructures.Queue.
 
QuickSort - class applications.QuickSort.
 
QuickSort() - Constructor for class applications.QuickSort
 
quickSort(Comparable[]) - Static method in class applications.QuickSort
sort a[0 : a.length - 1] using the quick sort method

R

r - Variable in class dataStructures.SkipList
 
railroad(int[], int, int) - Static method in class applications.RailroadWithQueues
rearrange railroad cars beginning with the initial order inputOrder[1:theNumberOfCars]
railroad(int[], int, int) - Static method in class applications.RailroadWithNoQueues
rearrange railroad cars beginning with the initial order inputOrder[1:theNumberOfCars]
railroad(int[], int, int) - Static method in class applications.RailroadWithStacks
rearrange railroad cars beginning with the initial order inputOrder[1:theNumberOfCars]
RailroadWithNoQueues - class applications.RailroadWithNoQueues.
 
RailroadWithNoQueues() - Constructor for class applications.RailroadWithNoQueues
 
RailroadWithQueues - class applications.RailroadWithQueues.
 
RailroadWithQueues() - Constructor for class applications.RailroadWithQueues
 
RailroadWithStacks - class applications.RailroadWithStacks.
 
RailroadWithStacks() - Constructor for class applications.RailroadWithStacks
 
Rank - class applications.Rank.
 
Rank() - Constructor for class applications.Rank
 
rank(Comparable[], int[]) - Static method in class applications.Rank
 
rankSort(Comparable[]) - Static method in class applications.RankSort2
sort the array a using the rank sort method
rankSort(Comparable[]) - Static method in class applications.RankSort1
sort the array a using the rank sort method
RankSort1 - class applications.RankSort1.
 
RankSort1() - Constructor for class applications.RankSort1
 
RankSort2 - class applications.RankSort2.
 
RankSort2() - Constructor for class applications.RankSort2
 
RatInAMaze - class applications.RatInAMaze.
 
RatInAMaze() - Constructor for class applications.RatInAMaze
 
readBoolean() - Method in class utilities.MyInputStream
Input a boolean.
readByte() - Method in class utilities.MyInputStream
Input a byte.
readDouble() - Method in class utilities.MyInputStream
Input a double.
readFloat() - Method in class utilities.MyInputStream
Input a float.
readInteger() - Method in class utilities.MyInputStream
Input an integer.
readLong() - Method in class utilities.MyInputStream
Input a long.
readShort() - Method in class utilities.MyInputStream
Input a short.
readString() - Method in class utilities.MyInputStream
Input a string.
rear - Variable in class dataStructures.LinkedQueue
 
RecursiveBTBoard - class applications.RecursiveBTBoard.
 
RecursiveBTBoard() - Constructor for class applications.RecursiveBTBoard
 
RecursiveBTKnapsack - class applications.RecursiveBTKnapsack.
 
RecursiveBTKnapsack() - Constructor for class applications.RecursiveBTKnapsack
 
RecursiveBTLoading1 - class applications.RecursiveBTLoading1.
 
RecursiveBTLoading1() - Constructor for class applications.RecursiveBTLoading1
 
RecursiveBTLoading2 - class applications.RecursiveBTLoading2.
 
RecursiveBTLoading2() - Constructor for class applications.RecursiveBTLoading2
 
RecursiveBTLoading3 - class applications.RecursiveBTLoading3.
 
RecursiveBTLoading3() - Constructor for class applications.RecursiveBTLoading3
 
RecursiveDPImageCompression1 - class applications.RecursiveDPImageCompression1.
 
RecursiveDPImageCompression1() - Constructor for class applications.RecursiveDPImageCompression1
 
RecursiveDPImageCompression2 - class applications.RecursiveDPImageCompression2.
 
RecursiveDPImageCompression2() - Constructor for class applications.RecursiveDPImageCompression2
 
RecursiveDPKnapsack - class applications.RecursiveDPKnapsack.
 
RecursiveDPKnapsack() - Constructor for class applications.RecursiveDPKnapsack
 
RecursiveDPKnapsack3 - class applications.RecursiveDPKnapsack3.
 
RecursiveDPKnapsack3() - Constructor for class applications.RecursiveDPKnapsack3
 
RecursiveDPMatrixChain1 - class applications.RecursiveDPMatrixChain1.
 
RecursiveDPMatrixChain1() - Constructor for class applications.RecursiveDPMatrixChain1
 
RecursiveDPMatrixChain2 - class applications.RecursiveDPMatrixChain2.
 
RecursiveDPMatrixChain2() - Constructor for class applications.RecursiveDPMatrixChain2
 
RecursiveSequentialSearch - class applications.RecursiveSequentialSearch.
 
RecursiveSequentialSearch() - Constructor for class applications.RecursiveSequentialSearch
 
RecursiveSum - class applications.RecursiveSum.
 
RecursiveSum() - Constructor for class applications.RecursiveSum
 
recursiveSum(Computable[], int) - Static method in class applications.RecursiveSum
 
recursiveSum(Computable[], int) - Static method in class misc.RecursiveSumStepCount
 
RecursiveSumStepCount - class misc.RecursiveSumStepCount.
 
RecursiveSumStepCount() - Constructor for class misc.RecursiveSumStepCount
 
remove() - Method in class dataStructures.LinkedQueue
remove an element from the front of the queue
remove() - Method in class dataStructures.ArrayQueue
remove an element from the front of the queue
remove() - Method in interface dataStructures.Queue
 
remove(int) - Method in class dataStructures.Chain
Remove the element with specified index.
remove(int) - Method in class dataStructures.ArrayLinearList
Remove the element with specified index.
remove(int) - Method in class dataStructures.SimulatedChain
Remove the element with specified index.
remove(int) - Method in interface dataStructures.IndexedBSTree
 
remove(int) - Method in interface dataStructures.LinearList
 
remove(int) - Method in class dataStructures.LinearListAsVector
Remove the element with specified index.
remove(int) - Method in class dataStructures.LinearListAsAbstractClass
 
remove(int) - Method in class dataStructures.ExtendedChain
Remove the element with specified index.
remove(int) - Method in class dataStructures.ArrayLinearListWithIterator
Remove the element with specified index.
remove(int) - Method in class dataStructures.FastArrayLinearList
Remove the element with specified index.
remove(Object) - Method in class dataStructures.BinarySearchTree
 
remove(Object) - Method in class dataStructures.SortedChain
 
remove(Object) - Method in class dataStructures.HashChains
 
remove(Object) - Method in interface dataStructures.Dictionary
 
remove(Object) - Method in class dataStructures.SkipList
 
removeEdge(int, int) - Method in class dataStructures.Graph
 
removeEdge(int, int) - Method in class dataStructures.LinkedDigraph
remove the edge (i,j)
removeEdge(int, int) - Method in class dataStructures.LinkedGraph
remove the edge (i,j)
removeEdge(int, int) - Method in interface dataStructures.Network
 
removeEdge(int, int) - Method in class dataStructures.AdjacencyDigraph
remove the edge (i,j)
removeEdge(int, int) - Method in class dataStructures.AdjacencyGraph
remove the edge (i,j)
removeEdge(int, int) - Method in class dataStructures.AdjacencyWDigraph
remove the edge (i,j)
removeEdge(int, int) - Method in class dataStructures.AdjacencyWGraph
remove the edge (i,j)
removeElement(int) - Method in class dataStructures.GraphChain
delete element with element.vertex = theVertex
removeElementAt(int) - Method in class dataStructures.FormulaBasedLinearList
Remove the element with specified index.
removeElementAt(int) - Method in class dataStructures.VectorLinearList
Remove the element with specified index.
removeLeftSubtree() - Method in class dataStructures.LinkedBinaryTree
remove the left subtree
removeLeftSubtree() - Method in interface dataStructures.BinaryTree
 
removeMax() - Method in class dataStructures.MaxHeap
remove max element and return it
removeMax() - Method in interface dataStructures.MaxPriorityQueue
 
removeMax() - Method in class dataStructures.MaxHblt
remove max element and return it
removeMin() - Method in interface dataStructures.MinPriorityQueue
 
removeMin() - Method in class dataStructures.MinHeap
remove min element and return it
removeRightSubtree() - Method in class dataStructures.LinkedBinaryTree
remove the right subtree
removeRightSubtree() - Method in interface dataStructures.BinaryTree
 
rePlay(int) - Method in interface dataStructures.WinnerTree
 
rePlay(int) - Method in class dataStructures.CompleteWinnerTree
replay matches for player thePlayer
root() - Method in class dataStructures.LinkedBinaryTree
 
root() - Method in interface dataStructures.BinaryTree
 

S

S - Static variable in class dataStructures.SimulatedChain
 
S - Static variable in class dataStructures.SimulatedLinkedStack
 
ScoreObject - class applications.ScoreObject.
 
ScoreObject - class dataStructures.ScoreObject.
 
ScoreObject(int) - Constructor for class applications.ScoreObject
constructor
ScoreObject(int) - Constructor for class dataStructures.ScoreObject
constructor
Select - class applications.Select.
 
Select() - Constructor for class applications.Select
 
select(Comparable[], int) - Static method in class applications.Select
 
SelectionSort - class applications.SelectionSort.
 
SelectionSort() - Constructor for class applications.SelectionSort
 
selectionSort(Comparable[]) - Static method in class applications.EarlyTerminatingSelectionSort
sort the array a using the selection sort method
selectionSort(Comparable[]) - Static method in class applications.SelectionSort
sort the array a using the selection sort method
sequentialSearch(Object[], Object) - Static method in class applications.RecursiveSequentialSearch
Search the unordered array b for y.
sequentialSearch(Object[], Object) - Static method in class applications.SequentialSearch2
Search the unordered array a for x.
sequentialSearch(Object[], Object) - Static method in class applications.SequentialSearch1
Search the unordered array a for x.
SequentialSearch1 - class applications.SequentialSearch1.
 
SequentialSearch1() - Constructor for class applications.SequentialSearch1
 
SequentialSearch2 - class applications.SequentialSearch2.
 
SequentialSearch2() - Constructor for class applications.SequentialSearch2
 
set(int, int, Object) - Method in class dataStructures.Matrix
set this(i,j) = newValue
set(int, int, Object) - Method in class dataStructures.TridiagonalMatrix
set this(i,j) = newValue
set(int, int, Object) - Method in class dataStructures.DiagonalMatrix
set this(i,j) = newValue
set(int, int, Object) - Method in class dataStructures.LowerTriangularMatrix
set this(i,j) = newValue
set(int, Object) - Method in class dataStructures.ExtendedArrayLinearList
set element[index] to theElement
setCents(byte) - Method in class applications.Currency2
set cents = theCents
setCents(byte) - Method in class applications.CurrencyAsLong
set cents = theCents throws IllegalArgumentException when theCents < 0 or theCents > 99
setCents(byte) - Method in class applications.Currency
set cents = theCents
setDollars(long) - Method in class applications.Currency2
set dollars = theDollars
setDollars(long) - Method in class applications.CurrencyAsLong
set dollars = theDollars
setDollars(long) - Method in class applications.Currency
set dollars = theDollars
setElement(Object) - Method in class dataStructures.BinaryTreeNode
 
setLeftChild(BinaryTreeNode) - Method in class dataStructures.BinaryTreeNode
 
setRightChild(BinaryTreeNode) - Method in class dataStructures.BinaryTreeNode
 
setSign(boolean) - Method in class applications.Currency2
Set the sign of amount to theSign.
setSign(boolean) - Method in class applications.CurrencyAsLong
Set the sign of amount to theSign.
setSign(boolean) - Method in class applications.Currency
set sign = theSign
setSize(int) - Method in class dataStructures.ExtendedArrayList
set list size to newSize
setSize(int) - Method in class dataStructures.ExtendedArrayLinearList
set list size to newSize
setValue(Currency) - Method in class applications.Currency
 
setValue(Currency2) - Method in class applications.Currency2
 
setValue(CurrencyAsLong) - Method in class applications.CurrencyAsLong
 
setValue(double) - Method in class applications.Currency2
set amount
setValue(double) - Method in class applications.CurrencyAsLong
set amount
setValue(double) - Method in class applications.Currency
set sign, dollars, and cents
setValue(double) - Method in class wrappers.MyDouble
set value to theValue
setValue(int) - Method in class wrappers.MyInteger
set value to theValue
shortestPaths(int, Operable[], int[]) - Method in class dataStructures.AdjacencyWDigraph
find shortest paths from sourceVertex
showTowerStates(int, int, int, int) - Static method in class applications.TowersOfHanoiShowingStates
show the states of the three towers as disks are moved
SimpleHistogramming - class applications.SimpleHistogramming.
 
SimpleHistogramming() - Constructor for class applications.SimpleHistogramming
 
SimulatedChain - class dataStructures.SimulatedChain.
 
SimulatedChain() - Constructor for class dataStructures.SimulatedChain
 
SimulatedChain(int) - Constructor for class dataStructures.SimulatedChain
create a list that is empty
SimulatedLinkedStack - class dataStructures.SimulatedLinkedStack.
 
SimulatedLinkedStack() - Constructor for class dataStructures.SimulatedLinkedStack
 
SimulatedLinkedStack(int) - Constructor for class dataStructures.SimulatedLinkedStack
create an empty stack
SimulatedSpace1 - class dataStructures.SimulatedSpace1.
 
SimulatedSpace1(int) - Constructor for class dataStructures.SimulatedSpace1
 
SimulatedSpace2 - class dataStructures.SimulatedSpace2.
 
SimulatedSpace2(int) - Constructor for class dataStructures.SimulatedSpace2
 
size - Variable in class dataStructures.Chain
 
size - Variable in class dataStructures.SortedChain
 
size - Variable in class dataStructures.ArrayLinearList
 
size - Variable in class dataStructures.HashTable
 
size - Variable in class dataStructures.SimulatedChain
 
size - Variable in class dataStructures.FormulaBasedLinearList
 
size - Variable in class dataStructures.ArrayLinearListWithIterator
 
size - Variable in class dataStructures.FastArrayLinearList
 
size - Variable in class dataStructures.SkipList
 
size() - Method in class dataStructures.Chain
 
size() - Method in class dataStructures.LinkedBinaryTree
count number of nodes in tree
size() - Method in class dataStructures.SortedChain
 
size() - Method in interface dataStructures.MinPriorityQueue
 
size() - Method in class dataStructures.HashChains
 
size() - Method in class dataStructures.ArrayLinearList
 
size() - Method in class dataStructures.MinHeap
 
size() - Method in class dataStructures.HashTable
 
size() - Method in class dataStructures.SimulatedChain
 
size() - Method in interface dataStructures.LinearList
 
size() - Method in class dataStructures.MaxHeap
 
size() - Method in class dataStructures.LinearListAsVector
 
size() - Method in class dataStructures.FormulaBasedLinearList
 
size() - Method in interface dataStructures.MaxPriorityQueue
 
size() - Method in class dataStructures.VectorLinearList
 
size() - Method in class dataStructures.LinearListAsAbstractClass
 
size() - Method in class dataStructures.ArrayLinearListWithIterator
 
size() - Method in class dataStructures.MaxHblt
 
size() - Method in class dataStructures.FastArrayLinearList
 
size() - Method in class dataStructures.SkipList
 
SkipList - class dataStructures.SkipList.
 
SkipList.SkipNode - class dataStructures.SkipList.SkipNode.
 
SkipList.SkipNode(Object, Object, int) - Constructor for class dataStructures.SkipList.SkipNode
 
SkipList(Comparable, int, float) - Constructor for class dataStructures.SkipList
create an empty skip list
SortedChain - class dataStructures.SortedChain.
 
SortedChain.SortedChainNode - class dataStructures.SortedChain.SortedChainNode.
 
SortedChain.SortedChainNode() - Constructor for class dataStructures.SortedChain.SortedChainNode
 
SortedChain.SortedChainNode(Object, Object) - Constructor for class dataStructures.SortedChain.SortedChainNode
 
SortedChain.SortedChainNode(Object, Object, SortedChain.SortedChainNode) - Constructor for class dataStructures.SortedChain.SortedChainNode
 
SortedChain() - Constructor for class dataStructures.SortedChain
 
SortedChain(int) - Constructor for class dataStructures.SortedChain
create an empty sorted chain
SortedChainWithDuplicates - class dataStructures.SortedChainWithDuplicates.
 
SortedChainWithDuplicates() - Constructor for class dataStructures.SortedChainWithDuplicates
 
SparseMatrixAsExtendedArrayLinearList - class dataStructures.SparseMatrixAsExtendedArrayLinearList.
 
SparseMatrixAsExtendedArrayLinearList(int, int, int, Object) - Constructor for class dataStructures.SparseMatrixAsExtendedArrayLinearList
 
SparseMatrixAsExtendedArrayLinearList(int, int, Object) - Constructor for class dataStructures.SparseMatrixAsExtendedArrayLinearList
use a default estimated maximum size of 1
SparseMatrixAsExtendedArrayLinearList(Object) - Constructor for class dataStructures.SparseMatrixAsExtendedArrayLinearList
defaults are rows = cols = estimatedMaxSize = 1
SparseMatrixAsExtendedArrayList - class dataStructures.SparseMatrixAsExtendedArrayList.
 
SparseMatrixAsExtendedArrayList(int, int, int, Object) - Constructor for class dataStructures.SparseMatrixAsExtendedArrayList
 
SparseMatrixAsExtendedArrayList(int, int, Object) - Constructor for class dataStructures.SparseMatrixAsExtendedArrayList
use a default estimated maximum size of 1
SparseMatrixAsExtendedArrayList(Object) - Constructor for class dataStructures.SparseMatrixAsExtendedArrayList
defaults are rows = cols = estimatedMaxSize = 1
SparseMatrixAsVector - class dataStructures.SparseMatrixAsVector.
 
SparseMatrixAsVector(int, int, int, Object) - Constructor for class dataStructures.SparseMatrixAsVector
 
SparseMatrixAsVector(int, int, Object) - Constructor for class dataStructures.SparseMatrixAsVector
use a default estimated maximum size of 1
SparseMatrixAsVector(Object) - Constructor for class dataStructures.SparseMatrixAsVector
defaults are rows = cols = estimatedMaxSize = 1
squareMultiply(int[][], int[][], int[][], int) - Static method in class utilities.MatrixOperations
Multiply two n x n integer matrices.
squareMultiply2(int[][], int[][], int[][], int) - Static method in class utilities.MatrixOperations
Multiply two n x n integer matrices.
Stack - interface dataStructures.Stack.
 
StudentRecord - class applications.StudentRecord.
class used by BinSort
StudentRecord - class dataStructures.StudentRecord.
class used by BinSort
StudentRecord(String, int) - Constructor for class applications.StudentRecord
constructor
StudentRecord(String, int) - Constructor for class dataStructures.StudentRecord
constructor
subtract(Matrix) - Method in class dataStructures.Matrix
 
subtract(Object) - Method in class utilities.Dummy
 
subtract(Object) - Method in interface utilities.Computable
 
subtract(Object) - Method in class wrappers.MyInteger
 
subtract(Object) - Method in class wrappers.MyDouble
 
sum(Computable[], int) - Static method in class misc.SumStepCount1
 
sum(Computable[], int) - Static method in class misc.SumStepCount2
 
sum(Computable[], int) - Static method in class utilities.MyMath
Generic sum method.
sum(int[], int) - Static method in class utilities.MyMath
 
SumStepCount1 - class misc.SumStepCount1.
 
SumStepCount1() - Constructor for class misc.SumStepCount1
 
SumStepCount2 - class misc.SumStepCount2.
 
SumStepCount2() - Constructor for class misc.SumStepCount2
 
swap(int[], int, int) - Static method in class utilities.MyMath
Swap the integers a[i] and a[j].
swap(int, int) - Static method in class misc.NoSwap
Swap the integers x and y
swap(Object[], int, int) - Static method in class utilities.MyMath
Generic method to swap the object references a[i] and a[j].
SwitchBox - class applications.SwitchBox.
 
SwitchBox() - Constructor for class applications.SwitchBox
 

T

table - Variable in class dataStructures.HashTable
 
tailKey - Variable in class dataStructures.SkipList
 
tailNode - Variable in class dataStructures.SkipList
 
test - class dataStructures.test.
 
test - class utilities.test.
 
test() - Constructor for class dataStructures.test
 
test() - Constructor for class utilities.test
 
TestAllPairs - class dataStructures.TestAllPairs.
 
TestAllPairs() - Constructor for class dataStructures.TestAllPairs
 
TestBellmanFord - class dataStructures.TestBellmanFord.
 
TestBellmanFord() - Constructor for class dataStructures.TestBellmanFord
 
TestBipartiteCover - class dataStructures.TestBipartiteCover.
 
TestBipartiteCover() - Constructor for class dataStructures.TestBipartiteCover
 
TestBTMaxClique - class dataStructures.TestBTMaxClique.
 
TestBTMaxClique() - Constructor for class dataStructures.TestBTMaxClique
 
TestBTSalesperson - class dataStructures.TestBTSalesperson.
 
TestBTSalesperson() - Constructor for class dataStructures.TestBTSalesperson
 
TestConnected - class dataStructures.TestConnected.
 
TestConnected() - Constructor for class dataStructures.TestConnected
 
TestFindPath - class dataStructures.TestFindPath.
 
TestFindPath() - Constructor for class dataStructures.TestFindPath
 
TestGraphSearchMethods - class dataStructures.TestGraphSearchMethods.
 
TestGraphSearchMethods() - Constructor for class dataStructures.TestGraphSearchMethods
 
TestKruskal - class dataStructures.TestKruskal.
 
TestKruskal() - Constructor for class dataStructures.TestKruskal
 
TestLabelComponents - class dataStructures.TestLabelComponents.
 
TestLabelComponents() - Constructor for class dataStructures.TestLabelComponents
 
TestLeastCostBBSalesperson - class dataStructures.TestLeastCostBBSalesperson.
 
TestLeastCostBBSalesperson() - Constructor for class dataStructures.TestLeastCostBBSalesperson
 
TestMaxProfitBBMaxClique - class dataStructures.TestMaxProfitBBMaxClique.
 
TestMaxProfitBBMaxClique() - Constructor for class dataStructures.TestMaxProfitBBMaxClique
 
TestShortestPaths - class dataStructures.TestShortestPaths.
 
TestShortestPaths() - Constructor for class dataStructures.TestShortestPaths
 
TestTopologicalOrder - class dataStructures.TestTopologicalOrder.
 
TestTopologicalOrder() - Constructor for class dataStructures.TestTopologicalOrder
 
threeToLong(String) - Static method in class dataStructures.ConvertString
covert characters 0, 1, and 2 of s to a long
tileBoard(int, int, int, int, int) - Method in class applications.Chessboard
 
TimeArrayLinearList - class misc.TimeArrayLinearList.
 
TimeArrayLinearList() - Constructor for class misc.TimeArrayLinearList
 
TimeArrayList - class misc.TimeArrayList.
 
TimeArrayList() - Constructor for class misc.TimeArrayList
 
TimeArrayStack - class misc.TimeArrayStack.
 
TimeArrayStack() - Constructor for class misc.TimeArrayStack
 
TimeBFS - class misc.TimeBFS.
 
TimeBFS() - Constructor for class misc.TimeBFS
 
TimeChain - class misc.TimeChain.
 
TimeChain() - Constructor for class misc.TimeChain
 
TimeDerivedArrayStack - class misc.TimeDerivedArrayStack.
 
TimeDerivedArrayStack() - Constructor for class misc.TimeDerivedArrayStack
 
TimeDerivedArrayStackWithCatch - class misc.TimeDerivedArrayStackWithCatch.
 
TimeDerivedArrayStackWithCatch() - Constructor for class misc.TimeDerivedArrayStackWithCatch
 
TimeDerivedLinkedStack - class misc.TimeDerivedLinkedStack.
 
TimeDerivedLinkedStack() - Constructor for class misc.TimeDerivedLinkedStack
 
TimeDerivedVectorStack - class misc.TimeDerivedVectorStack.
 
TimeDerivedVectorStack() - Constructor for class misc.TimeDerivedVectorStack
 
TimeFastArrayLinearList - class misc.TimeFastArrayLinearList.
 
TimeFastArrayLinearList() - Constructor for class misc.TimeFastArrayLinearList
 
TimeFormulaStack - class misc.TimeFormulaStack.
 
TimeFormulaStack() - Constructor for class misc.TimeFormulaStack
 
TimeFormulaStackWithCatch - class misc.TimeFormulaStackWithCatch.
 
TimeFormulaStackWithCatch() - Constructor for class misc.TimeFormulaStackWithCatch
 
TimeInsertionSort1 - class misc.TimeInsertionSort1.
 
TimeInsertionSort1() - Constructor for class misc.TimeInsertionSort1
 
TimeInsertionSort2 - class misc.TimeInsertionSort2.
 
TimeInsertionSort2() - Constructor for class misc.TimeInsertionSort2
 
TimeInsertionSort3 - class misc.TimeInsertionSort3.
 
TimeInsertionSort3() - Constructor for class misc.TimeInsertionSort3
 
TimeInsertionSort4 - class misc.TimeInsertionSort4.
 
TimeInsertionSort4() - Constructor for class misc.TimeInsertionSort4
 
TimeLinearListAsVector - class misc.TimeLinearListAsVector.
 
TimeLinearListAsVector() - Constructor for class misc.TimeLinearListAsVector
 
TimeLinearListAsVectorSubclass - class misc.TimeLinearListAsVectorSubclass.
 
TimeLinearListAsVectorSubclass() - Constructor for class misc.TimeLinearListAsVectorSubclass
 
TimeLinkedList - class misc.TimeLinkedList.
 
TimeLinkedList() - Constructor for class misc.TimeLinkedList
 
TimeLinkedStack - class misc.TimeLinkedStack.
 
TimeLinkedStack() - Constructor for class misc.TimeLinkedStack
 
TimeMatrix - class misc.TimeMatrix.
 
TimeMatrix() - Constructor for class misc.TimeMatrix
 
TimeMatrixMultiply - class misc.TimeMatrixMultiply.
 
TimeMatrixMultiply() - Constructor for class misc.TimeMatrixMultiply
 
TimeOverhead - class misc.TimeOverhead.
 
TimeOverhead() - Constructor for class misc.TimeOverhead
 
TimeSimulatedChain - class misc.TimeSimulatedChain.
 
TimeSimulatedChain() - Constructor for class misc.TimeSimulatedChain
 
TimeSimulatedLinkedStack - class misc.TimeSimulatedLinkedStack.
 
TimeSimulatedLinkedStack() - Constructor for class misc.TimeSimulatedLinkedStack
 
TimeSparseMatrixAsExtendedArrayLinearList - class misc.TimeSparseMatrixAsExtendedArrayLinearList.
 
TimeSparseMatrixAsExtendedArrayLinearList() - Constructor for class misc.TimeSparseMatrixAsExtendedArrayLinearList
 
TimeSparseMatrixAsExtendedArrayList - class misc.TimeSparseMatrixAsExtendedArrayList.
 
TimeSparseMatrixAsExtendedArrayList() - Constructor for class misc.TimeSparseMatrixAsExtendedArrayList
 
TimeSparseMatrixAsVector - class misc.TimeSparseMatrixAsVector.
 
TimeSparseMatrixAsVector() - Constructor for class misc.TimeSparseMatrixAsVector
 
TimeStack - class misc.TimeStack.
 
TimeStack() - Constructor for class misc.TimeStack
 
TimeVectorStack - class misc.TimeVectorStack.
 
TimeVectorStack() - Constructor for class misc.TimeVectorStack
 
topNode - Variable in class dataStructures.LinkedStack
 
topNode - Variable in class dataStructures.SimulatedLinkedStack
 
topologicalOrder(int[]) - Method in class dataStructures.Graph
 
toString() - Method in class applications.StudentRecord
convert to a string
toString() - Method in class applications.Currency2
convert to a string
toString() - Method in class applications.TreeHistogramming.ElementType
 
toString() - Method in class applications.CurrencyAsLong
convert to a string
toString() - Method in class applications.Currency
convert to a string
toString() - Method in class dataStructures.Chain
convert to a string
toString() - Method in class dataStructures.Matrix
convert the matrix into a string so it can be output
toString() - Method in class dataStructures.LinkedSparseMatrix
convert the matrix into a string so it can be output
toString() - Method in class dataStructures.SortedChain
convert to a string
toString() - Method in class dataStructures.EdgeNode
 
toString() - Method in class dataStructures.WeightedEdgeNode
 
toString() - Method in class dataStructures.ArrayLinearList
convert to a string
toString() - Method in class dataStructures.MinHeap
 
toString() - Method in class dataStructures.SimulatedChain
convert to a string
toString() - Method in class dataStructures.StudentRecord
convert to a string
toString() - Method in class dataStructures.BinaryTreeNode
 
toString() - Method in interface dataStructures.LinearList
 
toString() - Method in class dataStructures.Edge
 
toString() - Method in class dataStructures.WeightedEdge
 
toString() - Method in class dataStructures.MaxHeap
 
toString() - Method in class dataStructures.LinearListAsVector
convert to a string
toString() - Method in class dataStructures.FormulaBasedLinearList
convert to a string
toString() - Method in class dataStructures.VectorLinearList
convert to a string
toString() - Method in class dataStructures.LinearListAsAbstractClass
 
toString() - Method in class dataStructures.SparseMatrixAsExtendedArrayLinearList
convert the matrix into a string so it can be output
toString() - Method in class dataStructures.SparseMatrixAsVector
convert the matrix into a string so it can be output
toString() - Method in class dataStructures.ArrayLinearListWithIterator
convert to a string
toString() - Method in class dataStructures.SparseMatrixAsExtendedArrayList
convert the matrix into a string so it can be output
toString() - Method in class dataStructures.MaxHblt
 
toString() - Method in class dataStructures.FastArrayLinearList
convert to a string
toString() - Method in class dataStructures.SkipList
convert to a string
toString() - Method in class wrappers.MyInteger
 
toString() - Method in class wrappers.MyDouble
 
TowersOfHanoi - class applications.TowersOfHanoi.
 
TowersOfHanoi() - Constructor for class applications.TowersOfHanoi
 
towersOfHanoi(int) - Static method in class applications.TowersOfHanoiShowingStates
n disk Towers of Hanoi problem
towersOfHanoi(int, int, int, int) - Static method in class applications.TowersOfHanoi
output a sequence of disk moves for the Towers of Hanoi problem
TowersOfHanoiShowingStates - class applications.TowersOfHanoiShowingStates.
 
TowersOfHanoiShowingStates() - Constructor for class applications.TowersOfHanoiShowingStates
 
traceback(int[][], int[], int, int[]) - Static method in class applications.IterativeDPKnapsack
compute solution vector x
traceback(int[][], int, int) - Static method in class applications.IterativeDPMatrixChain
output best way to compute Mij
traceback(int[][], int, int) - Static method in class applications.RecursiveDPMatrixChain2
output best way to compute Mij
traceback(int[][], int, int) - Static method in class applications.RecursiveDPMatrixChain1
output best way to compute Mij
traceback(int[], int) - Static method in class applications.RecursiveDPImageCompression1
output the optimal segment boundaries
traceback(int[], int) - Static method in class applications.RecursiveDPImageCompression2
output the optimal segment boundaries
traceback(int[], int) - Static method in class applications.IterativeDPImageCompression
output the optimal segment boundaries
traceback(int[], int[][], int[]) - Static method in class applications.IterativeDPNoncrossingSubset
put max noncrossing subset in net[0:sizeOfMNS-1]
transpose() - Method in class dataStructures.LinkedSparseMatrix
 
transpose() - Method in class dataStructures.SparseMatrixAsExtendedArrayLinearList
 
transpose() - Method in class dataStructures.SparseMatrixAsVector
 
transpose() - Method in class dataStructures.SparseMatrixAsExtendedArrayList
 
transpose(int[][], int) - Static method in class utilities.MatrixOperations
in-place transpose of matrix a[0:rows-1][0:rows-1]
TreeHistogramming - class applications.TreeHistogramming.
 
TreeHistogramming.ElementType - class applications.TreeHistogramming.ElementType.
 
TreeHistogramming.ElementType(int) - Constructor for class applications.TreeHistogramming.ElementType
 
TreeHistogramming() - Constructor for class applications.TreeHistogramming
 
TridiagonalMatrix - class dataStructures.TridiagonalMatrix.
 
TridiagonalMatrix(int, Object) - Constructor for class dataStructures.TridiagonalMatrix
 

U

UndefinedMethodException - exception exceptions.UndefinedMethodException.
 
UndefinedMethodException() - Constructor for class exceptions.UndefinedMethodException
 
UndefinedMethodException(String) - Constructor for class exceptions.UndefinedMethodException
 
union(int, int) - Method in class applications.FastUnionFind
combine trees with distinct roots rootA and rootB
UnionFindFirstSolution - class applications.UnionFindFirstSolution.
 
UnionFindFirstSolution() - Constructor for class applications.UnionFindFirstSolution
 
UnionFindSecondSolution - class applications.UnionFindSecondSolution.
 
UnionFindSecondSolution() - Constructor for class applications.UnionFindSecondSolution
 
UnionFindWithTrees - class applications.UnionFindWithTrees.
 
UnionFindWithTrees(int) - Constructor for class applications.UnionFindWithTrees
initialize n trees, one element per tree/class/set
UsingAVector - class misc.UsingAVector.
 
UsingAVector() - Constructor for class misc.UsingAVector
 
utilities - package utilities
 

V

valueOf(Computable[], Computable) - Static method in class applications.Horner
 
valueOf(Computable[], Computable) - Static method in class applications.EvaluatePolynomial
 
vBits(int[], int[], int[]) - Static method in class applications.RecursiveDPImageCompression1
set class data members and invoke method s
vBits(int[], int[], int[]) - Static method in class applications.RecursiveDPImageCompression2
set class data members and invoke method s
vBits(int[], int[], int[], int[]) - Static method in class applications.IterativeDPImageCompression
iterative dynamic programming segment combining code l and b are inputs, s and kay are computed
VectorLinearList - class dataStructures.VectorLinearList.
 
VectorLinearList() - Constructor for class dataStructures.VectorLinearList
create a list with initial capacity 10
VectorLinearList(int) - Constructor for class dataStructures.VectorLinearList
create a list with initial capacity initialCapacity
VectorStack - class dataStructures.VectorStack.
 
VectorStack() - Constructor for class dataStructures.VectorStack
create a stack with initial capacity 10
VectorStack(int) - Constructor for class dataStructures.VectorStack
create a stack with the given initial capacity
verifyDirected(String) - Method in class dataStructures.Graph
verify that the graph is a directed graph
verifyUndirected(String) - Method in class dataStructures.Graph
verify that the graph is an undirected graph
verifyWeighted(String) - Method in class dataStructures.Graph
verify that the graph is a weighted graph
verifyWeightedUndirected(String) - Method in class dataStructures.Graph
verify that the graph is a weighted undirected graph
vertices() - Method in class dataStructures.Graph
 
vertices() - Method in class dataStructures.LinkedDigraph
 
vertices() - Method in interface dataStructures.Network
 
vertices() - Method in class dataStructures.AdjacencyDigraph
 
vertices() - Method in class dataStructures.AdjacencyWDigraph
 
visit(BinaryTreeNode) - Method in interface dataStructures.Visitable
 
visit(BinaryTreeNode) - Static method in class dataStructures.BinaryTreeTraversal
visit method that prints the element in the node
Visitable - interface dataStructures.Visitable.
 

W

WeightedEdge - class dataStructures.WeightedEdge.
 
WeightedEdge(int, int, Object) - Constructor for class dataStructures.WeightedEdge
 
WeightedEdgeNode - class dataStructures.WeightedEdgeNode.
 
WeightedEdgeNode(int, Object) - Constructor for class dataStructures.WeightedEdgeNode
 
Welcome - class misc.Welcome.
 
Welcome() - Constructor for class misc.Welcome
 
winnerOf(Playable) - Method in class applications.FirstFit.Bin
 
winnerOf(Playable) - Method in class dataStructures.Player
 
winnerOf(Playable) - Method in interface dataStructures.Playable
 
WinnerTree - interface dataStructures.WinnerTree.
 
WireRouter - class applications.WireRouter.
 
WireRouter() - Constructor for class applications.WireRouter
 
wrappers - package wrappers
 

Z

Zero - interface utilities.Zero.
Interface to be implemented by all classes that implement provide a zero value and test for zero.
zero() - Method in class utilities.Dummy
 
zero() - Method in interface utilities.Computable
 
zero() - Method in interface utilities.Zero
 
zero() - Method in class wrappers.MyInteger
 
zero() - Method in class wrappers.MyDouble
 

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