All Classes and Interfaces

Class
Description
 
 
 
 
 
Provides methods to generate arrays of Integer objects, arrays of doubles in [0.0,1.0), and arrays of characters.
 
 
 
The Bag class represents a bag (or multiset) of generic items.
 
 
 
Binary input.
Binary output.
 
BinarySearchST<K extends Comparable<? super K>,V>
 
 
 
 
 
 
 
 
BST<K extends Comparable<? super K>,V>
 
BST.Node<K extends Comparable<? super K>,V>
 
BTree<K extends Comparable<? super K>,V>
 
BTree.Entry<K extends Comparable<? super K>,V>
 
BTree.Node<K extends Comparable<? super K>,V>
 
 
 
 
A map from filenames to file contents.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
The Digraph class represents an directed graph of vertices named 0 through V-1.
The DigraphGenerator class provides static methods for creating various digraphs, including Erdos-Renyi random digraphs, random DAGs, random rooted trees, random rooted DAGs, random tournaments, path digraphs, cycle digraphs, and the complete digraph.
 
 
 
 
 
The DirectedEdge class represents a weighted edge in an directed graph.
The DirectedEulerianCycle class represents a data type for finding an Eulerian cycle or path in a digraph.
The DirectedEulerianPath class represents a data type for finding an Eulerian path in a digraph.
 
 
 
 
The Edge class represents a weighted edge in an undirected graph.
The EdgeWeightedDigraph class represents an directed graph of vertices named 0 through V-1, where each edge has a real-valued weight.
 
The EdgeWeightedGraph class represents an undirected graph of vertices named 0 through V-1, where each edge has a real-valued weight.
The EulerianCycle class represents a data type for finding an Eulerian cycle or path in a graph.
 
The EulerianPath class represents a data type for finding an Eulerian path in a graph.
 
 
 
 
 
 
 
 
The FlowEdge class represents a capacitated edge with a flow in a digraph.
 
 
 
Code for formatting values and other static utilities.
 
 
 
 
 
The Graph class represents an undirected graph of vertices named 0 through V-1.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Input.
Printer for events.
IndexMaxPQ<K extends Comparable<? super K>>
The IndexMaxPQ class represents an indexed priority queue of generic keys.
IndexMinPQ<K extends Comparable<? super K>>
The IndexMinPQ class represents an indexed priority queue of generic keys.
 
Map from threads to booleans.
 
 
 
 
 
 
 
Monitor incoming JDI events for a program running in the JVM and print out trace/debugging information.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
MaxPQ<K extends Comparable<? super K>>
The MaxPQ class represents a priority queue of generic keys.
 
 
MinPQ<K extends Comparable<? super K>>
The MinPQ class represents a priority queue of generic keys.
 
 
 
 
The Deck class has the following API:
Complete the following method to sort a deck of cards, with the restriction that the only allowed operations are to look at the values of the top two cards, to exchange the top two cards, and to move the top card to the bottom of the deck.
 
This is a skeleton file for your homework.
 
 
 
 
 
 
 
This is a skeleton file for your homework.
This is a skeleton file for your homework.
This is a skeleton file for your homework.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
MyMinMaxPQ<K extends Comparable<? super K>>
 
MyPtrHeap<K extends Comparable<? super K>>
The PMytrHeap class is the priorityQ class from Question 2.4.24.
 
 
 
 
For this assignment, you must do two things: 1.
This is a skeleton file for your homework.
 
 
 
 
 
 
This class provides methods for writing strings and numbers to various output streams, including standard output, file, and sockets.
 
 
 
 
This class provides methods for manipulating individual pixels of an image.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
The Queue class represents a first-in-first-out (FIFO) queue of generic items.
 
 
 
 
 
 
 
 
 
 
 
 
RedBlackBST<K extends Comparable<? super K>,V>
 
 
 
The ResizingArrayBag class represents a bag (or multiset) of generic items.
 
 
 
 
 
 
 
SET<K extends Comparable<? super K>>
The SET class represents an ordered set.
 
 
 
 
ST<K extends Comparable<? super K>,V>
This class represents an ordered symbol table.
The Stack class represents a last-in-first-out (LIFO) stack of generic items.
From sedgewick and wayne
 
 
The Stack class represents a last-in-first-out (LIFO) stack of generic items.
 
Standard audio.
Standard draw.
Standard input.
Standard output.
Standard random.
Standard statistics.
Stopwatch.
StreamRedirecter is a thread which copies it's input to it's output and terminates when it completes.
 
 
 
 
 
 
 
 
 
 
 
Traces the execution of a target program.
 
 
 
 
 
 
 
 
 
 
The UF interface represents a union-find data data structure.
Keeps track of values in order to spot changes.
 
 
The UF class represents a union-find data data structure.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
XBTreeWithCasts<K extends Comparable<? super K>,V>
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
XFixedMaxPQ<K extends Comparable<? super K>>
 
XFixedMinPQ<K extends Comparable<? super K>>
 
 
 
 
 
XFrequencyTable<K extends Comparable<? super K>>
 
 
 
 
 
 
 
 
 
 
 
 
 
XIndexSET<K extends Comparable<? super K>>
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
XRandomizedBST<K extends Comparable<? super K>,V>
 
 
 
XRedBlackLiteBST<K extends Comparable<? super K>,V>
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
XSplayBST<K extends Comparable<? super K>,V>