All Packages  Class Hierarchy

Index of all Fields and Methods

A

add(Comparable). Method in interface rpi.goldsd.container.AssociativeContainer

Adds a new associative entry to this associative container.

add(Comparable). Method in class rpi.goldsd.container.Table

Adds a new associative entry to this hashtable.

add(Comparable, Object). Method in interface rpi.goldsd.container.AssociativeContainer

Adds a new associative entry to this associative container.

add(Comparable, Object). Method in class rpi.goldsd.container.Table

Adds a new associative entry to this hashtable.

add(Edge). Method in class rpi.goldsd.graph.Graph

Adds the given edge to this graph if it is not already in this graph.

add(Edge). Method in class rpi.goldsd.graph.Path

Adds an edge and its corresponding destination vertex to the end of this path.

add(Edge, Vertex). Method in class rpi.goldsd.graph.Tree

Adds an edge and corresponding vertex to this tree.

add(Vertex). Method in class rpi.goldsd.graph.Graph

Adds the given vertex to this graph if it is not already in this graph.

add(Vertex). Method in class rpi.goldsd.graph.Path

Adds an edge and its corresponding destination vertex to the end of this path.

addAfter(ListNode, ListNode). Method in class rpi.goldsd.container.LinkedList

Adds a new ListNode object to this linked-list after the given ListNode object existingNode.

addBase(Edge). Method in class rpi.goldsd.graph.GraphBase

Adds the given edge to this graph if it is not already in this graph.

addBase(Vertex). Method in class rpi.goldsd.graph.GraphBase

Adds the given vertex to this graph if it is not already in this graph.

addIncidentEdge(Edge). Method in class rpi.goldsd.graph.Vertex

Adds an incident edge to this vertex.

addIncomingEdge(DirectedEdge). Method in class rpi.goldsd.graph.Vertex

Adds an incoming directed edge to this vertex.

addStartVertex(Vertex). Method in class rpi.goldsd.graph.Path

Initializes this path and adds the starting vertex to this path.

addToHead(ListNode). Method in class rpi.goldsd.container.LinkedList

Adds a new ListNode object to this linked-list at the beginning of the list.

addToTail(ListNode). Method in class rpi.goldsd.container.LinkedList

Adds a new ListNode object to this linked-list at the end of the list.

Algorithms(). Constructor for class rpi.goldsd.graph.Algorithms

AlphabetSequence(). Constructor for class rpi.goldsd.container.AlphabetSequence

associatedGraph. Variable in class rpi.goldsd.graph.Edge

A reference to the graph that this undirected edge is associated with; or null if this undirected edge is not associated with a graph.

associatedGraph. Variable in class rpi.goldsd.graph.Vertex

A reference to the graph that this vertex is associated with; or null if this vertex is not associated with a graph.

B

backtrack(). Method in class rpi.goldsd.graph.Path

Removes the last vertex and edge from this path.

Bool(). Constructor for class rpi.goldsd.container.Bool

Constructs a Bool object with default value false.

Bool(boolean). Constructor for class rpi.goldsd.container.Bool

Initializes the underlying boolean primitive data type.

breadthFirstTraversal(Graph). Static method in class rpi.goldsd.graph.Algorithms

Returns a breadth-first traversal tree for the given graph starting at an arbitrary vertex.

breadthFirstTraversal(Vertex). Static method in class rpi.goldsd.graph.Algorithms

Returns a breadth-first traversal tree for the graph starting from the given vertex.

C

Char(). Constructor for class rpi.goldsd.container.Char

Constructs a Char object with a default value of 0.

Char(char). Constructor for class rpi.goldsd.container.Char

Initializes the underlying char primitive data type.

clear(). Method in interface rpi.goldsd.container.AssociativeContainer

Removes all elements from this associative container.

clear(). Method in class rpi.goldsd.graph.GraphBase

Removes all vertices and edges from this graph.

clear(). Method in class rpi.goldsd.container.Table

Removes all elements from this hashtable.

clear(). Method in class rpi.goldsd.graph.Tree

Removes all vertices and edges from this tree, except for the root Vertex object.

clone(). Method in class rpi.goldsd.graph.Graph

Clones this graph.

clone(). Method in class rpi.goldsd.graph.GraphBase

Clones this graph.

clone(). Method in class rpi.goldsd.graph.Path

Clones this path.

clone(). Method in class rpi.goldsd.graph.Tree

Clones this tree.

clone(). Method in class rpi.goldsd.graph.Vertex

Clones this vertex.

cloneEdge(Vertex, Vertex, Edge). Static method in class rpi.goldsd.graph.Algorithms

Since the Edge class does not implement the Cloneable interface, the static cloneEdge() exists for copying both directed and undirected edges.

complement(GraphBase). Static method in class rpi.goldsd.graph.Algorithms

Returns a graph that is the complement of the given graph.

concat(Path). Method in class rpi.goldsd.graph.Path

Concatenates the given path with this path by adding all elements of the given path to the end of this path.

contains(Comparable). Method in interface rpi.goldsd.container.AssociativeContainer

Returns true if the given key maps to an element in this associative container.

contains(Comparable). Method in class rpi.goldsd.container.LinkedList

Tests whether the given Comparable object exists in this linked-list by using the isEqualTo() method.

contains(Comparable). Method in class rpi.goldsd.container.Table

Returns true if the given key maps to an element in the associative container.

contains(Edge). Method in class rpi.goldsd.graph.GraphBase

Tests if a given edge exists in this graph.

contains(Edge). Method in class rpi.goldsd.graph.Path

Tests if a given edge exists in this path.

contains(Vertex). Method in class rpi.goldsd.graph.GraphBase

Tests if a given vertex exists in this graph.

contains(Vertex). Method in class rpi.goldsd.graph.Path

Tests if a given vertex exists in this path.

containsReferenceTo(ListNode). Method in class rpi.goldsd.container.LinkedList

Tests whether the given ListNode object exists in this linked-list by comparing the references of the objects (using the == operator).

D

data. Variable in class rpi.goldsd.graph.Edge

A reference to the Hashable object associated with this undirected edge.

data. Variable in class rpi.goldsd.container.ListNode

The data associated with this ListNode must implement the Comparable interface.

data. Variable in class rpi.goldsd.graph.Vertex

The Hashable object associated with this vertex.

data(). Method in class rpi.goldsd.graph.Edge

Returns a reference to the Hashable object that is associated with this undirected edge.

data(). Method in class rpi.goldsd.graph.Vertex

Returns a reference to the Hashable object that is associated with this vertex.

DEFAULT_NAME. Static variable in class rpi.goldsd.graph.GraphBase

The default name of a graph.

DEFAULT_SIZE. Static variable in class rpi.goldsd.container.Table

The default table size used by the default constructor.

degree(). Method in class rpi.goldsd.graph.Vertex

Returns the degree of this vertex.

depthFirstTraversal(Graph). Static method in class rpi.goldsd.graph.Algorithms

Returns a depth-first traversal tree for the given graph starting at an arbitrary vertex.

depthFirstTraversal(Vertex). Static method in class rpi.goldsd.graph.Algorithms

Returns a depth-first traversal tree for the graph starting from the given vertex.

DirectedEdge(). Constructor for class rpi.goldsd.graph.DirectedEdge

The default constructor is not to be used, since a directed edge must have a given start and end vertex.

DirectedEdge(Vertex, Vertex). Constructor for class rpi.goldsd.graph.DirectedEdge

Constructs a directed edge with the given start and end vertices.

DirectedEdge(Vertex, Vertex, double). Constructor for class rpi.goldsd.graph.DirectedEdge

Constructs a directed edge with the given start and end vertices, and the initial weight.

DirectedEdge(Vertex, Vertex, Hashable). Constructor for class rpi.goldsd.graph.DirectedEdge

Constructs a directed edge with the given start and end vertices, and the initial Hashable object to be associated with this directed edge.

DirectedEdge(Vertex, Vertex, Hashable, double). Constructor for class rpi.goldsd.graph.DirectedEdge

Constructs a directed edge with the given start and end vertices, the initial Hashable object to be associated with this directed edge, and the initial weight.

displayBicomponents(Graph). Static method in class rpi.goldsd.graph.Algorithms

After invoking the findBicomponents() method, this method simply displays the biconnected components of the given Graph object.

distance. Variable in class rpi.goldsd.graph.Vertex

Used by the static Algorithms class.

DuplicateElementException(). Constructor for class rpi.goldsd.container.DuplicateElementException

The default constructor simply calls the default constructor of the parent class RuntimeException.

DuplicateElementException(String). Constructor for class rpi.goldsd.container.DuplicateElementException

This constructor calls the corresponding constructor of the parent class RuntimeException with the given String argument to be displayed.

E

Edge(). Constructor for class rpi.goldsd.graph.Edge

The default constructor is not to be used, since an undirected edge must have a given start and end vertex.

Edge(Vertex, Vertex). Constructor for class rpi.goldsd.graph.Edge

Constructs an undirected edge with the given pair of endpoint vertices.

Edge(Vertex, Vertex, double). Constructor for class rpi.goldsd.graph.Edge

Constructs an undirected edge with the given pair of endpoint vertices, and the initial weight.

Edge(Vertex, Vertex, Hashable). Constructor for class rpi.goldsd.graph.Edge

Constructs an undirected edge with the given pair of endpoint vertices, the initial Hashable object to be associated with this undirected edge.

Edge(Vertex, Vertex, Hashable, boolean, double). Constructor for class rpi.goldsd.graph.Edge

Constructs an undirected edge with the given pair of endpoint vertices, the initial Hashable object to be associated with this undirected edge, and the initial weight.

Edge(Vertex, Vertex, Hashable, double). Constructor for class rpi.goldsd.graph.Edge

Constructs an undirected edge with the given pair of endpoint vertices, the initial Hashable object to be associated with this undirected edge, and the initial weight.

edgeBetween(Vertex, Vertex). Method in class rpi.goldsd.graph.GraphBase

Finds an edge of this graph that is between the two given vertices.

EdgeNotFoundException(). Constructor for class rpi.goldsd.graph.EdgeNotFoundException

The default constructor simply calls the default constructor of the parent class RuntimeException.

EdgeNotFoundException(String). Constructor for class rpi.goldsd.graph.EdgeNotFoundException

This constructor calls the corresponding constructor of the parent class RuntimeException with the String argument to be displayed.

edges. Variable in class rpi.goldsd.graph.GraphBase

Hashtable containing references to all edges in this graph.

edges(). Method in interface rpi.goldsd.graph.Drawable

Provides an enumeration of the edges of the graph-related object.

edges(). Method in class rpi.goldsd.graph.GraphBase

Returns an enumeration of the edges in this graph.

edges(). Method in class rpi.goldsd.graph.Path

Returns an enumeration of the edges in this path.

elements(). Method in interface rpi.goldsd.container.AssociativeContainer

Provides an enumeration of the data stored in this container.

elements(). Method in class rpi.goldsd.container.LinkedList

Provides an enumeration or traversal of this linked-list starting at the beginning of the list.

elements(). Method in class rpi.goldsd.graph.Path

Returns an enumeration of the vertices and edges in this path.

elements(). Method in class rpi.goldsd.container.Table

Provides an enumeration of the elements in this hashtable.

elements(int). Method in class rpi.goldsd.container.Table

Provides an enumeration of the elements in this hashtable for a specific hash value (i.e.

EmptyEnumeration(). Constructor for class rpi.goldsd.container.EmptyEnumeration

endValue. Variable in class rpi.goldsd.container.IntSequence

Default end value for all sequence() methods.

endVertex. Variable in class rpi.goldsd.graph.Edge

A reference to the second vertex endpoint associated with this undirected edge.

endVertex(). Method in class rpi.goldsd.graph.Edge

Returns the second vertex endpoint of this undirected edge.

F

find(Comparable). Method in class rpi.goldsd.container.LinkedList

Traverses this linked-list to find the given Comparable object by using the isEqualTo() method.

findBicomponents(Graph). Static method in class rpi.goldsd.graph.Algorithms

Finds the biconnected components of the given Graph object by using a depth-first traversal and the utility fields of the Vertex class.

findBicomponents(Graph, Algorithms. backtrackNode, Vertex). Static method in class rpi.goldsd.graph.Algorithms

Finds the biconnected components of the given Graph object by using a depth-first traversal and the utility fields of the Vertex class.

findEulerPath(Graph). Static method in class rpi.goldsd.graph.Algorithms

Attempts to find an Euler Path in a connected graph starting from an arbitrary vertex of the given graph.

findEulerPath(Vertex). Static method in class rpi.goldsd.graph.Algorithms

Attempts to find an Euler Path in a connected graph starting from a given vertex.

findLongestPath(Vertex, Vertex). Static method in class rpi.goldsd.graph.Algorithms

Using a simple greedy approach, this method attempts to approximate the longest path between two vertices.

findLongestPath2(Vertex, Vertex, int). Static method in class rpi.goldsd.graph.Algorithms

Using an algorithm involving stratified greed, this method attempts to approximate the longest path between two vertices.

findMaxWeightEdge(GraphBase). Static method in class rpi.goldsd.graph.Algorithms

The findMaxWeightEdge() method performs a linear search through the edges of the given graph to find the edge with the maximum weight.

findMinWeightEdge(GraphBase). Static method in class rpi.goldsd.graph.Algorithms

The findMinWeightEdge() method performs a linear search through the edges of the given graph to find the edge with the minimum weight.

findShortestPath(Vertex, Vertex). Static method in class rpi.goldsd.graph.Algorithms

The findShortestPath() method uses Dijkstra's Shortest Path algorithm as presented in Sara Baase's Computer Algorithms book (see reference [BAAS89]).

firstVertex(). Method in class rpi.goldsd.graph.Path

Returns a reference to the first vertex in this path.

FRINGE. Static variable in class rpi.goldsd.graph.Algorithms

Used by methods of the static Algorithms class to label a Vertex or Edge object as being a fringe vertex or edge.

G

getData(). Method in class rpi.goldsd.container.ListNode

Returns the Comparable object stored in this ListNode.

getNext(). Method in interface rpi.goldsd.container.Linkable

Returns a reference to the next element in the list.

getNext(). Method in class rpi.goldsd.container.ListNode

Returns a reference to the next Linkable object that follows this ListNode.

getPrevious(). Method in interface rpi.goldsd.container.Linkable

Returns a reference to the previous element in the list.

getPrevious(). Method in class rpi.goldsd.container.ListNode

Returns a reference to the previous Linkable object that precedes this ListNode.

getSize(). Method in interface rpi.goldsd.container.AssociativeContainer

Returns the number of elements in this container.

getSize(). Method in class rpi.goldsd.container.LinkedList

Returns the number of elements in this linked-list.

getSize(). Method in class rpi.goldsd.container.Table

Returns the number of elements in this hashtable.

getTableSize(). Method in class rpi.goldsd.container.Table

Returns the size of the hashtable.

graph(). Method in class rpi.goldsd.graph.Edge

Returns a reference to the graph that contains this undirected edge, if any.

Graph(). Constructor for class rpi.goldsd.graph.Graph

Constructs an unnamed empty graph.

graph(). Method in class rpi.goldsd.graph.Path

Returns a reference to the graph associated with this path.

graph(). Method in class rpi.goldsd.graph.Vertex

Returns a reference to the graph that contains this vertex, if any.

Graph(GraphBase). Constructor for class rpi.goldsd.graph.Graph

Constructs a graph by copying another graph.

Graph(int, double). Constructor for class rpi.goldsd.graph.Graph

Constructs a random unnamed graph with the specified number of vertices and the probability of an edge existing between each distinct pair of vertices.

Graph(int, double, double, double). Constructor for class rpi.goldsd.graph.Graph

Constructs a random unnamed graph with the specified number of vertices and the probability of an edge existing between each distinct pair of vertices.

Graph(int, double, Sequence, Sequence). Constructor for class rpi.goldsd.graph.Graph

Constructs a random unnamed graph with the specified number of vertices and the probability of an edge existing between each distinct pair of vertices.

Graph(int, int). Constructor for class rpi.goldsd.graph.Graph

Constructs an empty graph with the specified initial vertex hashtable size and initial edge hashtable size.

Graph(String). Constructor for class rpi.goldsd.graph.Graph

Constructs an empty graph with the specified name.

Graph(String, int, double). Constructor for class rpi.goldsd.graph.Graph

Constructs a random graph with the specified number of vertices and the probability of an edge existing between each distinct pair of vertices.

Graph(String, int, double, boolean, double, double, Sequence, Sequence). Constructor for class rpi.goldsd.graph.Graph

Constructs a random graph with the specified name, the number of vertices to create, and the probability of an undirected edge existing between each distinct pair of vertices.

Graph(String, int, double, double, double). Constructor for class rpi.goldsd.graph.Graph

Constructs a random graph with the specified number of vertices and the probability of an edge existing between each distinct pair of vertices.

Graph(String, int, double, Sequence, Sequence). Constructor for class rpi.goldsd.graph.Graph

Constructs a random graph with the specified number of vertices and the probability of an edge existing between each distinct pair of vertices.

Graph(String, int, int). Constructor for class rpi.goldsd.graph.Graph

Constructs an empty graph with the specified name, initial vertex hashtable size, and initial edge hashtable size.

GraphBase(). Constructor for class rpi.goldsd.graph.GraphBase

Constructs an unnamed empty graph.

GraphBase(GraphBase). Constructor for class rpi.goldsd.graph.GraphBase

Constructs a graph by copying another graph.

GraphBase(int, int). Constructor for class rpi.goldsd.graph.GraphBase

Constructs an empty graph with the specified initial vertex hashtable size and initial edge hashtable size.

GraphBase(String). Constructor for class rpi.goldsd.graph.GraphBase

Constructs an empty graph with the specified name.

GraphBase(String, int, int). Constructor for class rpi.goldsd.graph.GraphBase

Constructs an empty graph with the specified name, initial vertex hashtable size, and initial edge hashtable size.

graphCopyHelper(GraphBase, GraphBase). Static method in class rpi.goldsd.graph.GraphBase

This protected static method performs a deep copy of all edges and vertices in the graph source to the graph target.

H

hash(). Method in class rpi.goldsd.container.Bool

Returns the hash value of this Bool object, which is simply either 0 (false) or 1 (true).

hash(). Method in class rpi.goldsd.container.Char

Returns the hash value of this Char object, which is simply the underlying integer value of the character.

hash(). Method in class rpi.goldsd.graph.Edge

Returns the hash value of the Hashable data associated with this edge.

hash(). Method in interface rpi.goldsd.container.Hashable

Returns an integer representation of the object implementing the Hashable interface.

hash(). Method in class rpi.goldsd.container.Int

Returns the hash value of this Int object, which is simply the underlying integer value.

hash(). Method in class rpi.goldsd.container.Real

Returns the hash value of this Real object, which is simply the underlying double value, truncated.

hash(). Method in class rpi.goldsd.container.Str

Returns the hash value of this Str object, which is simply the hash value of the underlying String object.

hash(). Method in class rpi.goldsd.graph.Vertex

Returns the hash value of the Hashable data associated with this vertex.

hash(Comparable). Method in class rpi.goldsd.container.Table

Determines the hash value based on the Comparable key.

hash(int). Method in class rpi.goldsd.container.Bool

Returns the hash value of this Bool object, based on the given hashtable size.

hash(int). Method in class rpi.goldsd.container.Char

Returns the hash value of this Char object, based on the given hashtable size.

hash(int). Method in class rpi.goldsd.graph.Edge

Returns the hash value of the Hashable data associated with this edge.

hash(int). Method in interface rpi.goldsd.container.Hashable

Generates a valid hash value and will typically call the no-argument hash() method described above.

hash(int). Method in class rpi.goldsd.container.Int

Returns the hash value of this Int object, based on the given hashtable size.

hash(int). Method in class rpi.goldsd.container.Real

Returns the hash value of this Real object, based on the given hashtable size.

hash(int). Method in class rpi.goldsd.container.Str

Returns the hash value of this Str object, based on the given hashtable size.

hash(int). Method in class rpi.goldsd.graph.Vertex

Returns the hash value of the Hashable data associated with this vertex.

hasMoreElements(). Method in class rpi.goldsd.container.EmptyEnumeration

Returns false to indicate no elements exist in this enumeration.

head. Variable in class rpi.goldsd.container.LinkedList

A reference to the first element of this linked-list.

head(). Method in class rpi.goldsd.graph.DirectedEdge

Returns the vertex at the head of this directed edge (the vertex to which this directed edge leads).

I

I. Static variable in class rpi.goldsd.graph.Edge

IN_TREE_OR_PATH. Static variable in class rpi.goldsd.graph.Algorithms

Used by methods of the static Algorithms class to label a Vertex or Edge object as being part of a tree or path.

InAnotherGraphException(). Constructor for class rpi.goldsd.graph.InAnotherGraphException

The default constructor simply calls the default constructor of the parent class RuntimeException.

InAnotherGraphException(String). Constructor for class rpi.goldsd.graph.InAnotherGraphException

This constructor calls the corresponding constructor of the parent class RuntimeException with the String argument to be displayed.

incidentEdges. Variable in class rpi.goldsd.graph.Vertex

A reference to the Vector used to contain the set of edges incident with this vertex.

incidentEdges(). Method in class rpi.goldsd.graph.Vertex

Returns an enumeration of the edges incident with this vertex.

incomingEdges. Variable in class rpi.goldsd.graph.Vertex

A reference to the Vector used to contain the set of incoming directed edges incident to this vertex.

incomingEdges(). Method in class rpi.goldsd.graph.Vertex

Returns an enumeration of the incoming directed edges that are incident with this vertex.

inDegree(). Method in class rpi.goldsd.graph.Vertex

Returns the in-degree of this vertex.

insertAfter(Path, Vertex). Method in class rpi.goldsd.graph.Path

Inserts a given path into this path after the first occurrence of the given vertex in this path.

Int(). Constructor for class rpi.goldsd.container.Int

Constructs an Int object with a default value of 0.

Int(int). Constructor for class rpi.goldsd.container.Int

Initializes the underlying int primitive data type.

InternalGraphError(). Constructor for class rpi.goldsd.graph.InternalGraphError

The default constructor simply calls the default constructor of the parent class Error.

InternalGraphError(String). Constructor for class rpi.goldsd.graph.InternalGraphError

This constructor calls the corresponding constructor of the parent class Error with the String argument to be displayed.

IntSequence(). Constructor for class rpi.goldsd.container.IntSequence

Constructs an IntSequence object.

IntSequence(int). Constructor for class rpi.goldsd.container.IntSequence

Constructs an IntSequence object with the specified startValue default value.

IntSequence(int, int). Constructor for class rpi.goldsd.container.IntSequence

Constructs an IntSequence object with the specified startValue and endValue default values.

isClique(). Method in class rpi.goldsd.graph.Graph

Tests if this graph is a clique (a complete graph).

isComplete(). Method in class rpi.goldsd.graph.Graph

Tests if this graph is a complete graph.

isConnected(). Method in class rpi.goldsd.graph.Graph

Tests if this graph is a connected graph.

isCycle(). Method in class rpi.goldsd.graph.Path

Tests if this path is a cycle.

isDigraph(). Method in class rpi.goldsd.graph.GraphBase

Tests if this graph is a directed graph.

isEdgeBetween(Vertex, Vertex). Method in class rpi.goldsd.graph.GraphBase

Tests if an edge exists in this graph that is between the two given vertices.

isEmpty(). Method in interface rpi.goldsd.container.AssociativeContainer

Returns true if this container contains no elements.

isEmpty(). Method in class rpi.goldsd.graph.GraphBase

Tests if this graph contains any vertices.

isEmpty(). Method in class rpi.goldsd.container.LinkedList

Returns true if this linked-list contains no elements.

isEmpty(). Method in class rpi.goldsd.container.Table

Returns true if this hashtable contains no elements.

isEqualTo(Comparable). Method in class rpi.goldsd.container.Bool

Returns true if this Bool object is equal to the given Comparable argument C, which must be of type Bool.

isEqualTo(Comparable). Method in class rpi.goldsd.container.Char

Returns true if this Char object is equal to the given Comparable argument C, which must be of type Char.

isEqualTo(Comparable). Method in interface rpi.goldsd.container.Comparable

Returns true if the implicit Comparable object is equal to the given Comparable object C.

isEqualTo(Comparable). Method in class rpi.goldsd.graph.Edge

Tests if two edges are "equal" based on their Hashable data objects.

isEqualTo(Comparable). Method in class rpi.goldsd.container.Int

Returns true if this Int object is equal to the given Comparable argument C, which must be of type Int.

isEqualTo(Comparable). Method in class rpi.goldsd.container.ListNode

Compares this ListNode to either another ListNode object or to another Comparable object (presumably of the same type of the data associated with this ListNode).

isEqualTo(Comparable). Method in class rpi.goldsd.container.Real

Returns true if this Real object is equal to the given Comparable argument C, which must be of type Real.

isEqualTo(Comparable). Method in class rpi.goldsd.container.Str

Returns true if this Str object is equal to the given Comparable argument C, which must be of type Str.

isEqualTo(Comparable). Method in class rpi.goldsd.graph.Vertex

Tests if two vertices are "equal" based on their Hashable data objects.

isIncident(Edge). Method in class rpi.goldsd.graph.Vertex

Tests if the given edge is incident with this vertex.

isInGraph(). Method in class rpi.goldsd.graph.Edge

Tests if this undirected edge is associated with a graph.

isInGraph(). Method in class rpi.goldsd.graph.Vertex

Tests if this vertex is associated with a graph.

isInGraph(GraphBase). Method in class rpi.goldsd.graph.Edge

Tests if this undirected edge is associated with the given graph.

isInGraph(GraphBase). Method in class rpi.goldsd.graph.Vertex

Tests if this vertex is associated with the given graph.

isLessThan(Comparable). Method in class rpi.goldsd.container.Bool

Returns true if this Bool object is less than the given Comparable argument C, which must be of type Bool.

isLessThan(Comparable). Method in class rpi.goldsd.container.Char

Returns true if this Char object is less than the given Comparable argument C, which must be of type Char.

isLessThan(Comparable). Method in interface rpi.goldsd.container.Comparable

Returns true if the implicit Comparable object is less than the given Comparable object C.

isLessThan(Comparable). Method in class rpi.goldsd.graph.Edge

Tests if one edge is "less than" another based on their Hashable data objects.

isLessThan(Comparable). Method in class rpi.goldsd.container.Int

Returns true if this Int object is less than the given Comparable argument C, which must be of type Int.

isLessThan(Comparable). Method in class rpi.goldsd.container.ListNode

Compares this ListNode to either another ListNode object or to another Comparable object (presumably of the same type of the data associated with this ListNode).

isLessThan(Comparable). Method in class rpi.goldsd.container.Real

Returns true if this Real object is less than the given Comparable argument C, which must be of type Real.

isLessThan(Comparable). Method in class rpi.goldsd.container.Str

Returns true if this Str object is less than the given Comparable argument C, which must be of type Str.

isLessThan(Comparable). Method in class rpi.goldsd.graph.Vertex

Tests if one vertex is "less than" another based on the Hashable data objects.

isPrime(int). Static method in class rpi.goldsd.container.Int

The static isPrime() method is used to determine if a given int value is a prime number.

isPrime(Int). Static method in class rpi.goldsd.container.Int

The static isPrime() method is used to determine if a given Int object is a prime number.

isReachable(Vertex, Vertex). Method in class rpi.goldsd.graph.Path

Tests if the given endVertex is reachable from the startVertex in this path.

isSelfLoop(). Method in class rpi.goldsd.graph.Edge

Tests if this undirected edge is a self-loop.

isWeighted. Variable in class rpi.goldsd.graph.Edge

A flag used to indicate whether this edge is weighted.

isWeighted(). Method in class rpi.goldsd.graph.Edge

Tests if this undirected edge is a weighted edge.

isWeighted(). Method in class rpi.goldsd.graph.GraphBase

Tests if this graph is a weighted graph.

K

keys. Static variable in class rpi.goldsd.graph.Edge

keys(). Method in interface rpi.goldsd.container.AssociativeContainer

Provides an enumeration of the keys stored in this container.

keys(). Method in class rpi.goldsd.container.Table

Provides an enumeration of the keys stored in this hashtable.

L

lastVertex(). Method in class rpi.goldsd.graph.Path

Returns a reference to the last vertex in this path.

length(). Method in class rpi.goldsd.graph.Path

Returns the number of edges in this path.

LinkedList(). Constructor for class rpi.goldsd.container.LinkedList

The default constructor simply sets the protected data elements of this linked-list to values indicating an empty list.

ListNode(). Constructor for class rpi.goldsd.container.ListNode

The default constructor is not to be invoked.

ListNode(Comparable). Constructor for class rpi.goldsd.container.ListNode

The constructor contains a single required argument that represents the Comparable object to be stored in this ListNode.

M

map(Comparable). Method in interface rpi.goldsd.container.AssociativeContainer

Provides a mechanism for mapping a given key to its corresponding data.

map(Comparable). Method in class rpi.goldsd.container.Table

Provides a mechanism for mapping a given key to its corresponding data.

mapToEdge(Hashable). Method in class rpi.goldsd.graph.GraphBase

Maps the given key to an edge in this graph, if such a mapping exists in the underlying hashtable.

mapToVertex(Hashable). Method in class rpi.goldsd.graph.GraphBase

Maps the given key to a vertex in this graph, if such a mapping exists in the underlying hashtable.

MAX_VALUE. Static variable in class rpi.goldsd.container.Char

The largest value of type Char.

MAX_VALUE. Static variable in class rpi.goldsd.container.Int

The largest value of type Int.

MAX_VALUE. Static variable in class rpi.goldsd.container.Real

The largest value of type Real.

min. Variable in class rpi.goldsd.graph.Vertex

Used by the static Algorithms class.

MIN_VALUE. Static variable in class rpi.goldsd.container.Char

The smallest value of type Char.

MIN_VALUE. Static variable in class rpi.goldsd.container.Int

The smallest value of type Int.

MIN_VALUE. Static variable in class rpi.goldsd.container.Real

The smallest value of type Real.

N

name. Variable in class rpi.goldsd.graph.GraphBase

A reference to the user-defined name of this graph.

name(). Method in interface rpi.goldsd.graph.Drawable

Returns the name of this graph-related object.

name(). Method in class rpi.goldsd.graph.GraphBase

Returns the user-defined name associated with this graph.

name(). Method in class rpi.goldsd.graph.Path

Returns the name of the graph this path is associated with.

next. Variable in class rpi.goldsd.container.ListNode

Identifies the next ListNode object in the corresponding LinkedList object.

nextElement(). Method in class rpi.goldsd.container.EmptyEnumeration

Returns null.

numEdges(). Method in class rpi.goldsd.graph.GraphBase

Returns the number of edges in this graph.

numElements. Variable in class rpi.goldsd.container.LinkedList

The number of elements in this linked-list.

numElements. Variable in class rpi.goldsd.container.Table

The number of associated elements in this hashtable.

numIncidentEdges(). Method in class rpi.goldsd.graph.Vertex

Returns the number of edges incident with this vertex.

numVertices(). Method in class rpi.goldsd.graph.GraphBase

Returns the number of vertices in this graph.

O

occurrences(Edge). Method in class rpi.goldsd.graph.Path

Returns the number of occurrences of a given edge in this path.

occurrences(Vertex). Method in class rpi.goldsd.graph.Path

Returns the number of occurrences of a given vertex in this path.

outDegree(). Method in class rpi.goldsd.graph.Vertex

Returns the out-degree of this vertex.

P

parent. Variable in class rpi.goldsd.graph.Vertex

Used by the static Algorithms class.

path. Variable in class rpi.goldsd.graph.Path

A Vector representing this path.

Path(). Constructor for class rpi.goldsd.graph.Path

Constructs an empty path.

Path(int). Constructor for class rpi.goldsd.graph.Path

Constructs an empty path with the initial path capacity.

Path(Path). Constructor for class rpi.goldsd.graph.Path

Constructs a path by copying another path.

Path(Vertex). Constructor for class rpi.goldsd.graph.Path

Constructs a path with a given start vertex.

pathCopyHelper(Path, Path). Static method in class rpi.goldsd.graph.Path

This protected static method performs a deep copy of all edges and vertices in the path source to the path target.

PathDoesNotExistException(). Constructor for class rpi.goldsd.graph.PathDoesNotExistException

The default constructor simply calls the default constructor of the parent class RuntimeException.

PathDoesNotExistException(String). Constructor for class rpi.goldsd.graph.PathDoesNotExistException

This constructor calls the corresponding constructor of the parent class RuntimeException with the String argument to be displayed.

previous. Variable in class rpi.goldsd.container.ListNode

Identifies the previous ListNode object in the corresponding LinkedList object.

PrimeNumberSequence(). Constructor for class rpi.goldsd.container.PrimeNumberSequence

printSummary(). Method in class rpi.goldsd.graph.GraphBase

Displays basic information about this graph.

printSummary(). Method in class rpi.goldsd.graph.Vertex

Displays information about this vertex.

printSummary(boolean). Method in class rpi.goldsd.graph.GraphBase

Displays basic information about this graph.

R

RandomIntSequence(). Constructor for class rpi.goldsd.container.RandomIntSequence

rank. Variable in class rpi.goldsd.graph.Vertex

Rank field used internally by the static Algorithms class.

Real(). Constructor for class rpi.goldsd.container.Real

Constructs a Real object with a default value of 0.0.

Real(double). Constructor for class rpi.goldsd.container.Real

Initializes the underlying double primitive data type.

rehash(Hashable, Hashable, Edge). Method in class rpi.goldsd.graph.GraphBase

Rehashes an existing Edge object that is part of this graph, if necessary.

rehash(Hashable, Hashable, Vertex). Method in class rpi.goldsd.graph.GraphBase

Rehashes an existing Vertex object that is part of this graph, if necessary.

remove(Comparable). Method in interface rpi.goldsd.container.AssociativeContainer

Removes a data element from this container identified by the given key.

remove(Comparable). Method in class rpi.goldsd.container.LinkedList

Removes and returns a reference to the first occurrence of the given ListNode or Comparable object.

remove(Comparable). Method in class rpi.goldsd.container.Table

Removes a data element from this hashtable identified by the given key.

remove(Edge). Method in class rpi.goldsd.graph.Graph

Removes the given edge from this graph.

remove(Vertex). Method in class rpi.goldsd.graph.Graph

Removes the given vertex from this graph.

removeAllEdges(). Method in class rpi.goldsd.graph.Graph

Removes all edges from this graph.

removeAllIncidentEdges(). Method in class rpi.goldsd.graph.Vertex

Removes all incident edges from this vertex.

removeAllIncomingEdges(). Method in class rpi.goldsd.graph.Vertex

Removes all incoming edges from this vertex.

removeFromHead(). Method in class rpi.goldsd.container.LinkedList

Removes and returns a reference to the ListNode object that is currently the head of this list.

removeFromTail(). Method in class rpi.goldsd.container.LinkedList

Removes and returns a reference to the ListNode object that is currently the tail of this list.

removeIncidentEdge(Edge). Method in class rpi.goldsd.graph.Vertex

Finds and removes an incident edge from this vertex.

removeIncomingEdge(DirectedEdge). Method in class rpi.goldsd.graph.Vertex

Finds and removes an incoming directed edge from this vertex.

root. Variable in class rpi.goldsd.graph.Tree

A reference to the root Vertex object of this tree.

root(). Method in class rpi.goldsd.graph.Tree

Returns a reference to the root vertex of this tree.

S

sequence(). Method in class rpi.goldsd.container.AlphabetSequence

Returns an enumeration of sequential characters starting at 'a' and ending at 'z'.

sequence(). Method in class rpi.goldsd.container.IntSequence

Returns an enumeration of sequential integer values starting at 1.

sequence(). Method in class rpi.goldsd.container.PrimeNumberSequence

Returns an enumeration of sequential prime number integer values starting at 2.

sequence(). Method in class rpi.goldsd.container.RandomIntSequence

Returns an enumeration of pseudo-random integer values using the linear congruential method with a default value of 25 as the seed value.

sequence(). Method in interface rpi.goldsd.container.Sequence

Provides an enumeration of the elements making up a sequence of values starting at a default start value.

sequence(char). Method in class rpi.goldsd.container.AlphabetSequence

Returns an enumeration of sequential characters starting at the given c value.

sequence(int). Method in class rpi.goldsd.container.IntSequence

Returns an enumeration of sequential integer values starting at the given start value i.

sequence(int). Method in class rpi.goldsd.container.PrimeNumberSequence

Returns an enumeration of sequential prime number integer values starting at the given start value i.

sequence(int). Method in class rpi.goldsd.container.RandomIntSequence

Returns an enumeration of pseudo-random integer values using the given seed value s.

sequence(Object). Method in class rpi.goldsd.container.AlphabetSequence

Returns an enumeration of sequential characters starting at the given start character.

sequence(Object). Method in class rpi.goldsd.container.IntSequence

Returns an enumeration of sequential integer values starting at the given start value.

sequence(Object). Method in class rpi.goldsd.container.PrimeNumberSequence

Returns an enumeration of sequential prime number integer values starting at the given start value.

sequence(Object). Method in class rpi.goldsd.container.RandomIntSequence

Returns an enumeration of pseudo-random integer values using the linear congruential method.

sequence(Object). Method in interface rpi.goldsd.container.Sequence

Provides an enumeration of the elements making up a sequence of values starting at the given start value.

setData(Comparable). Method in class rpi.goldsd.container.ListNode

Sets the Comparable object stored in this ListNode.

setData(Hashable). Method in class rpi.goldsd.graph.Edge

Sets the Hashable object that is associated with this edge.

setData(Hashable). Method in class rpi.goldsd.graph.Vertex

Sets the Hashable object that is associated with this vertex.

setInGraph(GraphBase). Method in class rpi.goldsd.graph.Edge

Sets the associatedGraph reference to the given graph G.

setInGraph(GraphBase). Method in class rpi.goldsd.graph.Vertex

Sets the associatedGraph reference to the graph G.

setName(String). Method in class rpi.goldsd.graph.GraphBase

Sets the name of this graph to the given String argument.

setNext(Linkable). Method in interface rpi.goldsd.container.Linkable

Establishes a link to the next element in the list.

setNext(Linkable). Method in class rpi.goldsd.container.ListNode

Establishes a link to the next Linkable object in the list.

setPrevious(Linkable). Method in interface rpi.goldsd.container.Linkable

Establishes a link to the previous element in the list.

setPrevious(Linkable). Method in class rpi.goldsd.container.ListNode

Establishes a link to the previous Linkable object in the list.

setWeight(double). Method in class rpi.goldsd.graph.Edge

Sets the weight of this edge.

startValue. Variable in class rpi.goldsd.container.IntSequence

Default start value for the no-argument sequence() method.

startVertex. Variable in class rpi.goldsd.graph.Edge

A reference to the first vertex endpoint associated with this undirected edge.

startVertex(). Method in class rpi.goldsd.graph.Edge

Returns the first vertex endpoint of this undirected edge.

status. Variable in class rpi.goldsd.graph.Edge

Used by the static Algorithms class.

status. Variable in class rpi.goldsd.graph.Vertex

Status field used internally by the static Algorithms class.

Str(). Constructor for class rpi.goldsd.container.Str

Constructs a Str object with a default value of "".

Str(String). Constructor for class rpi.goldsd.container.Str

Initializes the underlying String object.

string. Variable in class rpi.goldsd.container.Str

The underlying String object.

T

table. Variable in class rpi.goldsd.container.Table

The array of references to LinkedList objects.

Table(). Constructor for class rpi.goldsd.container.Table

Constructs a hashtable with the default table size.

Table(int). Constructor for class rpi.goldsd.container.Table

Constructs a hashtable with the specified table size.

tail. Variable in class rpi.goldsd.container.LinkedList

A reference to the last element of this linked-list.

tail(). Method in class rpi.goldsd.graph.DirectedEdge

Returns the vertex at the tail of this directed edge (the vertex from which this directed edge originates).

toGraphDraw(Drawable). Static method in class rpi.goldsd.graph.Algorithms

Returns a String that contains all edges of the given Drawable object.

toGraphDraw(Drawable, String). Static method in class rpi.goldsd.graph.Algorithms

Creates an HTML file that contains the edge-representation of the given Drawable object.

toString(). Method in class rpi.goldsd.container.Bool

Displays this Bool object in the form of a String object.

toString(). Method in class rpi.goldsd.container.Char

Displays this Char object in the form of a String object.

toString(). Method in class rpi.goldsd.graph.Edge

Returns a String representation of this undirected edge.

toString(). Method in class rpi.goldsd.graph.GraphBase

Returns a String representation of this graph (to keep output concise, the String representation currently consists of the name of the graph).

toString(). Method in class rpi.goldsd.container.Int

Displays this Int object in the form of a String object.

toString(). Method in class rpi.goldsd.container.LinkedList

The toString() is the default method used to display this linked-list in the form of a String object.

toString(). Method in class rpi.goldsd.container.ListNode

The toString() is the default method used to display this ListNode object in the form of a String object.

toString(). Method in class rpi.goldsd.graph.Path

Returns a String representation of this path.

toString(). Method in class rpi.goldsd.container.Real

Displays this Real object in the form of a String object.

toString(). Method in class rpi.goldsd.container.Str

Displays this Str object in the form of a String object.

toString(). Method in class rpi.goldsd.container.Table

The toString() method is the default method used to display the keys and corresponding data elements of this hashtable.

toString(). Method in class rpi.goldsd.graph.Vertex

Returns a String representation of this vertex.

TRAVERSED. Static variable in class rpi.goldsd.graph.Algorithms

Used by methods of the static Algorithms class to label an Edge object as being traversed.

traverseFrom(Vertex). Method in class rpi.goldsd.graph.DirectedEdge

Traverses this directed edge from a given vertex, returning the destination vertex.

traverseFrom(Vertex). Method in class rpi.goldsd.graph.Edge

Traverses this undirected edge from a given vertex, returning the destination vertex.

Tree(). Constructor for class rpi.goldsd.graph.Tree

Default constructor is not used, since a tree must, by definition, have a root vertex.

Tree(String, int, int). Constructor for class rpi.goldsd.graph.Tree

Constructs a tree with the specified name, initial vertex hashtable size, and initial edge hashtable size.

Tree(Tree). Constructor for class rpi.goldsd.graph.Tree

Constructs a tree by copying another tree.

Tree(Vertex). Constructor for class rpi.goldsd.graph.Tree

Constructs an unnamed tree with the specified root vertex.

Tree(Vertex, int, int). Constructor for class rpi.goldsd.graph.Tree

Constructs a tree with the specified root vertex, initial vertex hashtable size and initial edge hashtable size.

Tree(Vertex, String). Constructor for class rpi.goldsd.graph.Tree

Constructs a tree with the specified root vertex and name.

Tree(Vertex, String, int, int). Constructor for class rpi.goldsd.graph.Tree

Constructs a tree with the specified root vertex, name, initial vertex hashtable size, and initial edge hashtable size.

U

UNSEEN. Static variable in class rpi.goldsd.graph.Algorithms

Used by methods of the static Algorithms class to label a Vertex or Edge object as being unseen.

V

value. Variable in class rpi.goldsd.container.Bool

The underlying primitive data type.

value. Variable in class rpi.goldsd.container.Char

The underlying primitive data type.

value. Variable in class rpi.goldsd.container.Int

The underlying primitive data type.

value. Variable in class rpi.goldsd.container.Real

The underlying primitive data type.

Vertex(). Constructor for class rpi.goldsd.graph.Vertex

Constructs a vertex with default attributes.

Vertex(Hashable). Constructor for class rpi.goldsd.graph.Vertex

Constructs a vertex with the initial user-defined object to be associated with this vertex.

Vertex(int). Constructor for class rpi.goldsd.graph.Vertex

Constructs a vertex with the initial integer value to be associated with this vertex.

Vertex(String). Constructor for class rpi.goldsd.graph.Vertex

Constructs a vertex with the initial String object to be associated with this vertex.

Vertex(Vertex). Constructor for class rpi.goldsd.graph.Vertex

Constructs a vertex by copying the attributes of another vertex.

VertexNotFoundException(). Constructor for class rpi.goldsd.graph.VertexNotFoundException

The default constructor simply calls the default constructor of the parent class RuntimeException.

VertexNotFoundException(String). Constructor for class rpi.goldsd.graph.VertexNotFoundException

This constructor calls the corresponding constructor of the parent class RuntimeException with the String argument to be displayed.

vertices. Variable in class rpi.goldsd.graph.GraphBase

Hashtable containing references to all vertices in this graph.

vertices(). Method in interface rpi.goldsd.graph.Drawable

Provides an enumeration of the vertices of the graph-related object.

vertices(). Method in class rpi.goldsd.graph.GraphBase

Returns an enumeration of the vertices in this graph.

vertices(). Method in class rpi.goldsd.graph.Path

Returns an enumeration of the vertices of this path.

W

weight. Variable in class rpi.goldsd.graph.Edge

The weight associated with this undirected edge.

weight(). Method in class rpi.goldsd.graph.Edge

Returns the weight of this undirected edge, if any.

weight(). Method in class rpi.goldsd.graph.Path

Returns the weight of this path, which is simply the sum of all weighted edges of this path.