|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
a[u][v] is the weight
of edge (u,v).
a[u][v]
equals absentValue, then edge (u,v) is not present
in the graph.
Vertex.
- addVertex(Vertex) -
Method in class com.mhhe.clrs2e.AdjacencyMatrixGraph
- Adds a vertex to this graph, given a
Vertex.
- addVertex(Vertex) -
Method in interface com.mhhe.clrs2e.Graph
- Adds a vertex to this graph, given a
Vertex.
- adj -
Variable in class com.mhhe.clrs2e.AdjacencyListGraph
- An array of adjacency lists.
- AdjacencyListGraph - class com.mhhe.clrs2e.AdjacencyListGraph.
- Implementation of a graph, using adjacency lists.
- AdjacencyListGraph.AdjListInfo - class com.mhhe.clrs2e.AdjacencyListGraph.AdjListInfo.
- Inner class for the adjacency list array.
- AdjacencyListGraph.AdjListInfo(Vertex) -
Constructor for class com.mhhe.clrs2e.AdjacencyListGraph.AdjListInfo
- Makes an AdjListInfo object for an empty list.
- AdjacencyListGraph.Edge - class com.mhhe.clrs2e.AdjacencyListGraph.Edge.
- Inner class for adjacency list edges.
- AdjacencyListGraph.Edge(Vertex, AdjacencyListGraph.Edge) -
Constructor for class com.mhhe.clrs2e.AdjacencyListGraph.Edge
- Creates a new edge.
- AdjacencyListGraph.EdgeIterator - class com.mhhe.clrs2e.AdjacencyListGraph.EdgeIterator.
- Inner class for an iterator that iterates through the edges
incident on a given vertex.
- AdjacencyListGraph.EdgeIterator(int) -
Constructor for class com.mhhe.clrs2e.AdjacencyListGraph.EdgeIterator
- Starts an iteration through the edges incident on a given
vertex.
- AdjacencyListGraph.VertexIterator - class com.mhhe.clrs2e.AdjacencyListGraph.VertexIterator.
- Inner class for a vertex iterator.
- AdjacencyListGraph.VertexIterator() -
Constructor for class com.mhhe.clrs2e.AdjacencyListGraph.VertexIterator
- Starts an iteration through the vertices.
- AdjacencyListGraph(int, boolean) -
Constructor for class com.mhhe.clrs2e.AdjacencyListGraph
- Creates an empty
AdjacencyListGraph.
- AdjacencyMatrixGraph - class com.mhhe.clrs2e.AdjacencyMatrixGraph.
- Implementation of a graph, using an adjacency matrix.
- AdjacencyMatrixGraph.EdgeIterator - class com.mhhe.clrs2e.AdjacencyMatrixGraph.EdgeIterator.
- Inner class for an iterator that iterates through the edges
incident on a given vertex.
- AdjacencyMatrixGraph.EdgeIterator(int) -
Constructor for class com.mhhe.clrs2e.AdjacencyMatrixGraph.EdgeIterator
- Starts an iteration through the edges incident on a given
vertex.
- AdjacencyMatrixGraph.VertexIterator - class com.mhhe.clrs2e.AdjacencyMatrixGraph.VertexIterator.
- Inner class for a vertex iterator.
- AdjacencyMatrixGraph.VertexIterator() -
Constructor for class com.mhhe.clrs2e.AdjacencyMatrixGraph.VertexIterator
- Starts an iteration through the vertices.
- AdjacencyMatrixGraph(int, boolean) -
Constructor for class com.mhhe.clrs2e.AdjacencyMatrixGraph
- Creates an empty
AdjacencyMatrixGraph.
- AllPairsShortestPaths - class com.mhhe.clrs2e.AllPairsShortestPaths.
- Abstract class for computing all-pairs shortest paths.
- AllPairsShortestPaths() -
Constructor for class com.mhhe.clrs2e.AllPairsShortestPaths
-
- append(DisjointSetLinkedList.DisjointSet, DisjointSetLinkedList.DisjointSet) -
Method in class com.mhhe.clrs2e.DisjointSetLinkedList
- Appends one set's list to another set's list.
- APSPMatrixMult - class com.mhhe.clrs2e.APSPMatrixMult.
- Abstract class that defines the
extendShortestPaths
method used by subclasses of AllPairsShortestPaths. - APSPMatrixMult() -
Constructor for class com.mhhe.clrs2e.APSPMatrixMult
-
- array -
Variable in class com.mhhe.clrs2e.Heap
- The array holding the heap.
- AssemblyLine - class com.mhhe.clrs2e.AssemblyLine.
- Implementation of assembly-line scheduling for two lines, as
described in Section 15.1 of Introduction to Algorithms,
Second edition.
- AssemblyLine(double[][], double[][], double[], double[], int) -
Constructor for class com.mhhe.clrs2e.AssemblyLine
- Computes the fastest way through the factory, allocating the
instance variables and storing the result in them.
spInfo array but not allocation of the
ShortestPathInfo objects referenced by the array.
BFSInfo objects, one per vertex, to hold
the result of the breadth-first search.
null.
Dictionary interface as a binary search tree
from Chapter 12 of Introduction to Algorithms, Second
edition.nil,
which is the root.
Handle.
c array if this node is not a leaf.
DoubleValued in the range [0, 1) via the
bucket sort algorithm from page 174 of Introduction to
Algorithms, Second edition.DynamicSetElement, throwing
a ClassCastException if the object fails to
implement the DynamicSetElement interface.
null if this
node has no children.
boolean value indicating whether this
activity starts no earlier than another finishes.
DynamicSetElement to another
object.
DynamicSetElement to another object.
DynamicSetElement stored in this
Handle to that stored in another.
WeightedEdge to
that of another.
PrimInfo object.
spInfo array.
spInfo array.
spInfo array.
spInfo array.
PrefixCodeItem.
NonNegativeInteger via the counting sort
algorithm from page 168 of Introduction to Algorithms,
Second edition.KeyExtractor, in which
each extract method just returns its argument.max and extractor to
defaults.
max to the default and
extractor to its argument.
max and extractor to its
arguments.
max to its argument and
extractor to the default.
NonNegativeInteger.
NonNegativeInteger, given the
maximum value in the array.
NonNegativeInteger, given the
maximum value in the array and array to sort into.
next.
next.
Node returned by the most
recent call to next.
Node returned by the most
recent call to next.
spInfo array but not allocation of the
ShortestPathInfo objects referenced by the array.
int.
String consisting of 0s and 1s.
String representation of a node's
object.
String representation of a node's
object.
OrderStatistics interface via the
deterministic Select procedure (which runs in linear time in the
worst case) from pages 189-190 of Introduction to
Algorithms, Second edition.DFSInfo objects, one per vertex, to hold
the result of the depth-first search.
null.
dfsInfo array.
Vertex object, key,
parent, and handle into the priority queue for each vertex.DijkstraInfo object.
spInfo array but not allocation of the
ShortestPathInfo objects referenced by the array.
true if this graph is directed,
false if undirected.
true if this graph is directed,
false if undirected.
double.t keys.
exchange method to update the index
part of each Handle.
exchange method to update the index
part of each Handle.
int.
int; an identity
function.
int, where the key is
the ith digit in base extractorRadix, and
assuming that extractorRadix^i.
NonNegativeInteger.
NonNegativeInteger; an
identity function.
NonNegativeInteger,
where the key is the ith digit in base
extractorRadix, and assuming that
extractorRadix^i.
NonNegativeInteger.
DFS.finish(com.mhhe.clrs2e.AdjacencyListGraph, com.mhhe.clrs2e.Vertex) method to insert the
finished vertex onto the front of the linked list.
DFS.finish(com.mhhe.clrs2e.AdjacencyListGraph, com.mhhe.clrs2e.Vertex) method to assign the
current SCC number to the vertex.
DFS.finish(com.mhhe.clrs2e.AdjacencyListGraph, com.mhhe.clrs2e.Vertex) method to insert the
finished vertex onto the front of the linked list.
AdjacencyListGraph.EdgeIterator to implement
FlowNetworkEdgeIterator.FlowNetwork.
FlowNetworkEdgeIterator (so that the caller does
not need to cast the result), that iterates through the edges
incident on a given vertex in a flow network.
FlowNetworkEdgeIterator (so that the caller does
not need to cast the result), that iterates through the edges
incident on a given vertex in a flow network.
BFSInfo object for a
given vertex.
BFSInfo object for a
given vertex.
int.
next.
next.
DFSInfo object for a
given vertex.
DFSInfo object for a
given vertex.
next.
next.
double) of an object.
next.
next.
next.
next.
ShortestPathInfo object
for a given vertex.
ShortestPathInfo object
for a given pair of vertices.
ShortestPathInfo object
for a given vertex.
ShortestPathInfo object
for a given pair of vertices.
next.
next.
next.
WeightedAdjacencyMatrixGraph to a matrix of
edge weights.
null if the vertex is not in the
priority queue.
null if the vertex is not in the
priority queue.
hashCode value and the multiplication method.
h2.
true if this vertex iterator has more
vertices, false otherwise.
true if this edge iterator has more
edges, false otherwise.
true if this vertex iterator has more
vertices, false otherwise.
true if this edge iterator has more
edges, false otherwise.
true if this edge iterator has more
edges, false otherwise.
true if this iterator has more
elements, false otherwise.
true if this iterator has more
elements, false otherwise.
true if this iterator has more
elements, false otherwise.
true if this edge iterator has more
edges, false otherwise.
computeShortestPaths, returns
true if no negative-weight cycles were detected,
false if a negative-weight cycle was detected.
computeShortestPaths, returns
true if no negative-weight cycles were detected,
false if a negative-weight cycle was detected.
Handle.
Sorter interface via heapsort.PrefixCodeItem.
next.
next.
String.
Visitor to each node in the subtree.
Visitor
to each node.
Comparable.
Comparable.
Sorter interface via insertion sort from
page 17 of Introduction to Algorithms, Second edition.nil,
which is the root.
true if this graph is directed,
false if undirected.
true if this graph is directed,
false if undirected.
true if this graph is directed,
false if undirected.
true if the heap is empty,
false otherwise.
true if this list is empty,
false otherwise.
true if this list is empty,
false otherwise.
true if the max-priority queue is empty,
false if non-empty.
true if the min-priority queue is empty,
false if non-empty.
true if the queue is empty,
false otherwise.
true if the queue is empty,
false otherwise.
true if the list is empty (containing
only its sentinel), and false otherwise.
true if this list is empty,
false otherwise.
true if the stack is empty,
false otherwise.
true if the stack is empty,
false otherwise.
true if the given node is the sentinel
nil, false otherwise.
true if the table size is a power of 2,
false otherwise.
Iterator object for this
list.
Iterator object for this
list.
Iterator object for this
list.
ShortestPathInfo objects in
spInfo.
next.
next.
true if this node is a leaf,
false if this node is an interior node.
RedBlackTree's RedBlackTree.leftRotate(com.mhhe.clrs2e.RedBlackTree.Node)
and then fixes the max fields.
RedBlackTree's RedBlackTree.leftRotate(com.mhhe.clrs2e.RedBlackTree.Node)
and then fixes the size fields.
Direction.
AdjacencyListGraph
with no edges, given the number of vertices and a boolean
indicating whether the graph is directed.
WeightedAdjacencyListGraph with no edges, given
the number of vertices and a boolean indicating whether the
graph is directed.
Heap.Heapsort object that will sort this heap.
true if this node is marked,
false if not marked.
t-1.
array[p..q] and
array[q+1..r].
Sorter interface via merge sort from
pages 29 and 32 of Introduction to Algorithms, Second edition.array[p..r].
NonNegativeInteger.DijkstraInfo object, overriding
SingleSourceShortestPaths.newShortestPathInfo().
ShortestPathInfo object.
Node referenced by this
Handle.
true if no negative-weight cycles were detected,
false if a negative-weight cycle was detected.
true if no negative-weight cycles were detected,
false if a negative-weight cycle was detected.
Comparable objects.OrderStatisticTree.actualSize() if the size of the
subtree does not agree with the size field of the subtree's
root node.SizeException.
nil,
which is the root.
null if this node is a
root.
null if this node is a
root.
Comparable objects.Visitor to each node in the subtree.
Visitor
to each node.
Visitor to each node in the subtree.
Visitor
to each node.
Vertex object, key,
parent, and handle into the priority queue for each vertex.boolean as 0s
and 1s.
double.
String describing an optimal
parenthesization of a subproblem.
String representation of the set
containing a given object.
SentinelDLL.Sorter interface via quicksort from
page 146 of Introduction to Algorithms, Second edition.array[p..r].
NonNegativeInteger via the radix sort
algorithm from page 172 of Introduction to Algorithms,
Second edition.radix instance variables to its
argument and and digits to a default value.
Comparable objects.Sorter interface via randomized quicksort
from page 154 of Introduction to Algorithms, Second
edition.OrderStatistics interface via the
Randomized-Select procedure (which runs in linear expected time)
from page 186 of Introduction to Algorithms, Second
edition.array[p..r].
Dictionary interface as a red-black tree
from Chapter 13 of Introduction to Algorithms, Second
edition.RedBlackTree.blackHeight(com.mhhe.clrs2e.RedBlackTree.Node) if the black-height of
a node is ill-defined.nil, which is
the root.
v, based
on the Relax procedure on page 586 of Introduction to
Algorithms, Second edition.
true if this iterator is to return only edges
in the residual network, false if it is to
return all edges (even those whose residual capacity is not
positive.
RedBlackTree's RedBlackTree.rightRotate(com.mhhe.clrs2e.RedBlackTree.Node) and then fixes the max
fields.
RedBlackTree's RedBlackTree.rightRotate(com.mhhe.clrs2e.RedBlackTree.Node)
and then fixes the size fields.
NO_SCC.
dfsInfo array.
bfsInfo array.
array[p..r].
nil to a given node.
nil to a given node.
nil to a given node, and make the
sentinel black.
next.
next.
next.
null.
null if this
node has no right sibling.
spInfo array but not allocation of the
ShortestPathInfo objects referenced by the array.
Comparable objects.
Comparable objects.
Comparable objects.
Comparable objects.
Comparable objects.
Comparable objects.
Comparable objects.
DoubleValued.
NonNegativeInteger.
NonNegativeInteger.
sccNumber array so
that sccNumber[i] is the SCC number of the vertex
whose index is i.
String representation of this
activity, using half-open interval notation.
String representation of this
graph.
String representation of this
graph.
String representation of a fastest
way through the factory.
String representation of this object.
String representation of the
tree, representing the depth of each node by two spaces per
depth preceding the String representation of the
node.
data instance variable of this node
as a String.
String representation of this binomial
heap, based on the objects in the nodes.
String representation of this
node's object.
String representation of this B-tree
by walking it.
String representation of this object.
String representation of this system
of difference constraints.
String representation of this
difference constraint.
String representation of this
node.
String representation of this
node.
String representation of this
set, with each element appearing on a separate line.
String representation of this
Fibonacci heap, based on the objects in the nodes.
String representation of this
node's object, along with its degree and mark.
String representation of this
flow network.
String representation of this interval in
the form [low, high].
String representation of this
node.
String representation of this
object.
String representation of this list.
String.
String representation of this
Direction.
String describing an optimal
parenthesization of the entire matrix chain.
String representation of this
hash table, with one entry per line.
String representation of this
queue.
data instance variable of this
node and this node's color as a String.
String representation of this object.
String representation of this
vertex.
String representation of this
weighted graph.
String representation of this
graph.
String representation of
the subtree rooted at this node, representing the depth of
each node by two spaces per depth preceding the
String representation of the node.
max fields of its
ancestors before the superclass's insertNode is
called.
size fields of its
ancestors before the superclass's insertNode is
called.
decreaseKey operation.
String representation of the
subtree rooted at this node, based on the objects in the
nodes.
String representation of the
subtree rooted at this node.
String representation of the
subtree rooted at this node, based on the objects in the
nodes.
AdjacencyListGraph.EdgeIterator to implement
WeightedEdgeIterator.WeightedAdjacencyListGraph.
AdjacencyListGraph.EdgeIterator to implement
WeightedEdgeIterator.WeightedAdjacencyMatrixGraph.
WeightedEdgeIterator
(so that the caller does not need to cast the result), that
iterates through the weighted edges incident on a given vertex.
WeightedEdgeIterator
(so that the caller does not need to cast the result), that
iterates through the weighted edges incident on a given vertex.
WeightedEdgeIterator
(so that the caller does not need to cast the result), that
iterates through the weighted edges incident on a given vertex.
WeightedEdgeIterator
(so that the caller does not need to cast the result), that
iterates through the weighted edges incident on a given vertex.
next.
next.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||