All Packages  Class Hierarchy

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

Index of all Fields and Methods

A

actionPos. Variable in class jdsl.simple.ref.SimpleBinarySearchTree
AdditionOperator(). Constructor for class jdsl.core.algo.treetraversals.AdditionOperator
adjacentVertices(Vertex). Method in class jdsl.core.ref.AMSGraphTree
adjacentVertices(Vertex). Method in class jdsl.core.ref.FastSILGraph
adjacentVertices(Vertex). Method in interface jdsl.core.api.InspectableGraph: "Adjacent" here includes directed incoming edges, in addition to the more expected directed outgoing and undirected edges.
adjacentVertices(Vertex). Method in class jdsl.core.ref.SILGraph: Gets the adjacent vertices to a particular vertex.
after(Locator). Method in interface jdsl.core.api.OrderedDictionary: Returns the Locator that is sequentially after another Locator in this Container.
after(Locator). Method in class jdsl.core.ref.RBTree: Finds the locator after the passed in Locator.
after(Position). Method in class jdsl.core.ref.CircularNodeSequence: Gets the Position after a given Position in this CircularSequence.
after(Position). Method in interface jdsl.core.api.CircularSequence: Gets the Position after a given Position in this CircularSequence
after(Position). Method in class jdsl.core.ref.NodeSequence: Return position after this one
after(Position). Method in interface jdsl.core.api.PositionalSequence: Return the position immediately after the specified one.
after(Position). Method in class jdsl.core.ref.VCSVectorCircularSequence: Gets the Position after a given Position in this CircularSequence.
after(Position). Method in class jdsl.core.ref.VectorSequence: Gets the position after a position.
AlwaysInvalidLocator(String). Constructor for class jdsl.core.ref.AlwaysInvalidLocator
AMSGraphTree(). Constructor for class jdsl.core.ref.AMSGraphTree
AMSGTEdge(AMSGraphTree, Object). Constructor for class jdsl.core.ref.AMSGTEdge
AMSGTVertex(AMSGraphTree, Object). Constructor for class jdsl.core.ref.AMSGTVertex
areBiconnected(Position, Position). Method in class jdsl.core.algo.graphtraversals.BCTree
areInAdjacentBlocks(Position, Position). Method in class jdsl.core.algo.graphtraversals.BCTree
areInSameBlock(Position, Position). Method in class jdsl.core.algo.graphtraversals.BCTree
ArrayBubbleSort(). Constructor for class jdsl.core.algo.sorts.ArrayBubbleSort
ArrayEnumerator(Object[]). Constructor for class jdsl.core.ref.ArrayEnumerator: Enumeraition traverses.
ArrayInsertionSort(). Constructor for class jdsl.core.algo.sorts.ArrayInsertionSort
ArrayMergeSort(). Constructor for class jdsl.core.algo.sorts.ArrayMergeSort
ArrayQueue(). Constructor for class jdsl.simple.ref.ArrayQueue: This constructor initializes the queue with the default capacity specified by the CAPACITY constant.
ArrayQueue(int). Constructor for class jdsl.simple.ref.ArrayQueue: This constructor initializes the queue with the capacity specified by the user.
ArrayQuickSort(). Constructor for class jdsl.core.algo.sorts.ArrayQuickSort
ArraySelectionSort(). Constructor for class jdsl.core.algo.sorts.ArraySelectionSort
ArrayStack(). Constructor for class jdsl.simple.ref.ArrayStack: This constructor initializes the stack with the default capacity specified by the CAPACITY constant.
ArrayStack(int). Constructor for class jdsl.simple.ref.ArrayStack: This constructor initializes the stack with the capacity specified by the user.
atRank(int). Method in interface jdsl.core.api.BookSequence: Return the position with the specified rank.
atRank(int). Method in class jdsl.core.ref.NodeSequence: Return the position at the given rank
atRank(int). Method in interface jdsl.core.api.Sequence: Return the position with the specified rank.
atRank(int). Method in class jdsl.core.ref.VectorSequence

B

BCTree(). Constructor for class jdsl.core.algo.graphtraversals.BCTree
before(Locator). Method in interface jdsl.core.api.OrderedDictionary: Returns the Locator that is sequentially before another Locator in this Container.
before(Locator). Method in class jdsl.core.ref.RBTree: Finds the locator before the passed in Locator
before(Position). Method in class jdsl.core.ref.CircularNodeSequence: Gets the Position before a given Position in this CircularSequence
before(Position). Method in interface jdsl.core.api.CircularSequence: Gets the Position before a given Position in this CircularSequence
before(Position). Method in class jdsl.core.ref.NodeSequence: Return position before this one
before(Position). Method in interface jdsl.core.api.PositionalSequence: Return the position immediately before the specified one.
before(Position). Method in class jdsl.core.ref.VCSVectorCircularSequence: Gets the Position before a given Position in this CircularSequence
before(Position). Method in class jdsl.core.ref.VectorSequence: Gets the position before a position.
below(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.BinaryTreeTraversal
below(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.InorderTraversal
below(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.PrintExpressionTraversal
BiconnectivityAnalyzer(). Constructor for class jdsl.core.algo.graphtraversals.BiconnectivityAnalyzer
BinaryTreeTraversal(). Constructor for class jdsl.core.algo.treetraversals.BinaryTreeTraversal
BLACK. Static variable in interface jdsl.core.ref.RBColorConstants
BOUNDARY_VIOLATION. Static variable in interface jdsl.core.api.OrderedDictionary: Returned from all four methods of OrderedDictionary to indicate that the user tried to go before the first element of the dictionary or after the last.
BoundaryViolationException(String). Constructor for class jdsl.core.api.BoundaryViolationException
BTHeap(). Constructor for class jdsl.core.ref.BTHeap: comparator().
BTHeap(Comparator). Constructor for class jdsl.core.ref.BTHeap: comparator().
BTNodeBinaryTree(). Constructor for class jdsl.core.ref.BTNodeBinaryTree: a single leaf as the root.
BTNodeBinaryTree(BTNode). Constructor for class jdsl.core.ref.BTNodeBinaryTree: Constructs a new BTNodeBinaryTree with newRootas the root of the tree.
build(Position, int). Method in class jdsl.core.algo.treetraversals.RandomTreeBuilder

C

CAPACITY. Static variable in class jdsl.simple.ref.ArrayQueue: Default maximum capacity of the queue.
CAPACITY. Static variable in class jdsl.simple.ref.ArrayStack: Default maximum capacity of the stack.
case1(Position). Method in class jdsl.core.ref.RBTree: take care of case 1 after deletion: sib is red
case2(Position). Method in class jdsl.core.ref.RBTree
case3(Position). Method in class jdsl.core.ref.RBTree
case4(Position). Method in class jdsl.core.ref.RBTree
castEdge(Position). Method in class jdsl.core.ref.AMSGraphTree
castMutable(Position). Method in class jdsl.core.ref.AMSGraphTree: Casting methods
castToIndexedPosition(Position). Method in class jdsl.core.ref.VectorSequence: For the following routine, we pass back an InvalidPositionException, which will be more informational and useful to the programmer than a CCE.
castVertex(Position). Method in class jdsl.core.ref.AMSGraphTree
checkEmpty(). Method in class jdsl.core.ref.VectorSequence
checkKey(Object). Method in class jdsl.simple.ref.SimpleBinarySearchTree
checkLocator(Locator). Method in class jdsl.core.ref.SequenceLocPriorityQueue
checkPosition(Position). Method in class jdsl.core.ref.DumbEnumerationNodeSequence
checkPosition(Position). Method in class jdsl.core.ref.FastEnumerationNodeSequence
checkPosition(Position). Method in class jdsl.core.ref.NodeSequence
checkRank(int). Method in class jdsl.core.ref.DumbEnumerationNodeSequence
checkRank(int). Method in class jdsl.core.ref.FastEnumerationNodeSequence
checkRank(int). Method in class jdsl.core.ref.NodeSequence
checkRank(int). Method in class jdsl.core.ref.VectorSequence
checkValidity(). Method in class jdsl.core.ref.PELocator
children(Position). Method in class jdsl.core.ref.AMSGraphTree
children(Position). Method in class jdsl.core.algo.graphtraversals.BCTree
children(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: The returned Enumeration is guaranteed to give the children in left-to-right order.
children(Position). Method in interface jdsl.core.api.InspectableTree: The returned Enumeration is guaranteed to give the children in order from left to right.
children(Position). Method in class jdsl.core.ref.LinkedBinaryTree
CircularNodeSequence(). Constructor for class jdsl.core.ref.CircularNodeSequence: Constructs a new, empty sequence.
closestAfter(Object). Method in interface jdsl.core.api.OrderedDictionary: Returns a Locator whose key is sequentially greater than or equal to the search key.
closestAfter(Object). Method in class jdsl.core.ref.RBTree: Finds the Locator that comes right after a Locator with the given key
closestBefore(Object). Method in interface jdsl.core.api.OrderedDictionary: Returns a Locator whose key is sequentially less than or equal to the search key.
closestBefore(Object). Method in class jdsl.core.ref.RBTree: Finds the Locator that comes right before a Locator with the given key in the tree.
color(). Method in class jdsl.core.ref.RBTLocator
colorPromotion(Position). Method in class jdsl.core.ref.RBTree: handy color promotion method.....promotes the red up
comp. Variable in class jdsl.simple.ref.SequenceSimplePriorityQueue
comparator(). Method in class jdsl.core.ref.BTHeap: Retrieves the Comparator.
comparator(). Method in interface jdsl.core.api.ComparatorBased: Returns the Comparator used by this ComparatorBased container.
comparator(). Method in class jdsl.core.ref.RBTree: Retrieves the Comparator.
ConnectivityTest(). Constructor for class jdsl.core.algo.graphtraversals.ConnectivityTest
ContainedLocatorException(String). Constructor for class jdsl.core.api.ContainedLocatorException
container(). Method in class jdsl.core.ref.AlwaysInvalidLocator: Throws an InvalidLocatorException when an attempt is made to access the container of this locator.
container(). Method in class jdsl.core.ref.AMSGTEdge: Return the container holding this position.
container(). Method in class jdsl.core.ref.AMSGTVertex: Return the container holding this position.
container(). Method in class jdsl.core.ref.GenericPosition: Gets the container of this position.
container(). Method in interface jdsl.core.api.Locator
container(). Method in class jdsl.core.ref.LocItem
container(). Method in class jdsl.core.ref.Node
container(). Method in class jdsl.core.ref.PELocator
container(). Method in interface jdsl.core.api.Position: Return the container holding this position.
container(). Method in class jdsl.core.ref.RBTLocator
container(). Method in class jdsl.core.ref.SequencePosition: Override from Position
CoreException(String). Constructor for class jdsl.core.api.CoreException
current(). Method in class jdsl.core.ref.InOrderIterator: Gets the current Position
cut(Position). Method in interface jdsl.core.api.BinaryTree: Position subtreeRoot and all its children are removed from this tree and replaced with a new external node with a null element.
cut(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: Position subtreeRoot and all its children are removed from this tree and replaced with a new external node with a null element.
cut(Position). Method in class jdsl.core.ref.LinkedBinaryTree
cut(Position). Method in interface jdsl.core.api.Tree: This tree is cut above the position passed in, and that position is replaced with an external node with a null element.
cycleStart. Variable in class jdsl.core.algo.graphtraversals.FindCycleDFS

D

decSize(). Method in class jdsl.core.ref.VectorSequence: Provided for remove, which needs to decrease the size by one
degree(Vertex). Method in class jdsl.core.ref.AMSGraphTree
degree(Vertex). Method in class jdsl.core.ref.FastSILGraph
degree(Vertex). Method in interface jdsl.core.api.InspectableGraph
degree(Vertex). Method in class jdsl.core.ref.SILGraph: Gets the number of incident edges of a vertex.
DequeEmptyException(String). Constructor for class jdsl.simple.api.DequeEmptyException
DequeStack(). Constructor for class jdsl.simple.ref.DequeStack
dequeue(). Method in class jdsl.simple.ref.ArrayQueue: Removes the element which is the first element in the queue and return a reference to it.
dequeue(). Method in class jdsl.simple.ref.LinkedQueue
dequeue(). Method in interface jdsl.simple.api.Queue: Remove the element at the front.
destination(Edge). Method in class jdsl.core.ref.AMSGraphTree
destination(Edge). Method in class jdsl.core.ref.FastSILGraph
destination(Edge). Method in interface jdsl.core.api.InspectableGraph
destination(Edge). Method in class jdsl.core.ref.SILGraph: Gets the destination of an edge.
DFS(). Constructor for class jdsl.core.algo.graphtraversals.DFS
dfsVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.DFS: Performs a recursive depth-first search starting at v
Dijkstra(). Constructor for class jdsl.core.algo.weightedgraphs.Dijkstra
dijkstraVisit(Vertex). Method in class jdsl.core.algo.weightedgraphs.Dijkstra: The actual execution of dijkstra's algorithm.
directedEdges(). Method in class jdsl.core.ref.AMSGraphTree
directedEdges(). Method in class jdsl.core.ref.FastSILGraph
directedEdges(). Method in interface jdsl.core.api.InspectableGraph
directedEdges(). Method in class jdsl.core.ref.SILGraph: Gets all the directedEdges in this graph.
distance(Vertex). Method in class jdsl.core.algo.weightedgraphs.MyDijkstra
distances. Variable in class jdsl.core.algo.weightedgraphs.MyDijkstra
distances(). Method in class jdsl.core.algo.weightedgraphs.MyDijkstra: Gets the vertex distances.
done. Variable in class jdsl.core.algo.graphtraversals.FindCycleDFS
done. Variable in class jdsl.core.algo.graphtraversals.FindPathDFS
DOUBLEBLACK. Static variable in interface jdsl.core.ref.RBColorConstants
downheap(Position). Method in class jdsl.core.ref.BTHeap: Performs the downheap operation starting at p.
DrawingInfo(Color). Constructor for class jdsl.core.algo.treetraversals.DrawingInfo
DumbEnumerationNodeSequence(). Constructor for class jdsl.core.ref.DumbEnumerationNodeSequence

E

e_. Variable in class jdsl.core.ref.GenericPosition
edges(). Method in class jdsl.core.ref.AMSGraphTree
edges(). Method in class jdsl.core.ref.FastSILGraph
edges(). Method in interface jdsl.core.api.InspectableGraph
edges(). Method in class jdsl.core.ref.SILGraph: Gets all the edges in this graph.
elemAtRank(int). Method in class jdsl.simple.ref.NodeRankedSequence
elemAtRank(int). Method in interface jdsl.simple.api.RankedSequence: Inspect the element at a specified rank.
element(). Method in class jdsl.core.ref.AlwaysInvalidLocator: Throws an InvalidLocatorException when an attempt is made to access the element of this locator.
element(). Method in class jdsl.core.ref.AMSGTEdge: Return the element stored at this position.
element(). Method in class jdsl.core.ref.AMSGTVertex: Return the element stored at this position.
element(). Method in class jdsl.core.ref.GenericPosition: Gets the element of this position.
element(). Method in class jdsl.simple.ref.Item
element(). Method in class jdsl.simple.ref.KeyElementPair
element(). Method in interface jdsl.core.api.Locator
element(). Method in class jdsl.core.ref.Node
element(). Method in class jdsl.core.ref.PELocator
element(). Method in interface jdsl.core.api.Position: Return the element stored at this position.
element(). Method in class jdsl.core.ref.RBTLocator
element(). Method in class jdsl.core.ref.SequencePosition: Override from Position
element(Position). Method in class jdsl.simple.ref.SimpleBinarySearchTree
elements(). Method in class jdsl.core.ref.AMSGraphTree
elements(). Method in class jdsl.core.algo.graphtraversals.BCTree
elements(). Method in class jdsl.core.ref.BTHeap: Returns an Enumeration of all the elements within this Container.
elements(). Method in class jdsl.core.ref.BTNodeBinaryTree: Return the elements stored in this container.
elements(). Method in class jdsl.core.ref.CircularNodeSequence: Returns an Enumeration of all the elements stored in this container.
elements(). Method in interface jdsl.core.api.Container: Returns an enumeration of the elements stored in the container.
elements(). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Returns an enumeration of the elements in this sequence
elements(). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Returns an enumeration of the elements in this sequence
elements(). Method in class jdsl.core.ref.FastSILGraph
elements(). Method in class jdsl.core.ref.LinkedBinaryTree
elements(). Method in class jdsl.core.ref.NodeSequence: Returns an enumeration of the elements in this sequence
elements(). Method in class jdsl.core.ref.RBTree: Produces an Enumeration of the elements of all the Locators in the tree
elements(). Method in class jdsl.core.ref.SequenceLocPriorityQueue
elements(). Method in class jdsl.core.ref.SILGraph: Gets the elements in this graph.
elements(). Method in class jdsl.simple.ref.SimpleBinarySearchTree
elements(). Method in interface jdsl.simple.api.SimpleDictionary: Report the elements of all the items stored in the dictionary.
elements(). Method in class jdsl.core.ref.VCSVectorCircularSequence: Returns an Enumeration of all the elements stored in this container.
elements(). Method in class jdsl.core.ref.VectorSequence: Gets all the elements in this container, in order.
EmptyContainerException(String). Constructor for class jdsl.core.api.EmptyContainerException
endVertices(Edge). Method in class jdsl.core.ref.AMSGraphTree
endVertices(Edge). Method in class jdsl.core.ref.FastSILGraph
endVertices(Edge). Method in interface jdsl.core.api.InspectableGraph
endVertices(Edge). Method in class jdsl.core.ref.SILGraph: Gets the endpoints of an edge.
enqueue(Object). Method in class jdsl.simple.ref.ArrayQueue: Inserts a new object at the rear of the queue.
enqueue(Object). Method in class jdsl.simple.ref.LinkedQueue
enqueue(Object). Method in interface jdsl.simple.api.Queue: Insert an element at the rear.
EvalTest(). Constructor for class jdsl.core.algo.treetraversals.EvalTest
EvalTest2(). Constructor for class jdsl.core.algo.treetraversals.EvalTest2
EvalTest3(). Constructor for class jdsl.core.algo.treetraversals.EvalTest3
EvalTest4(). Constructor for class jdsl.core.algo.treetraversals.EvalTest4
EvaluateExpressionTraversal(). Constructor for class jdsl.core.algo.treetraversals.EvaluateExpressionTraversal
execute(BinaryTree). Method in class jdsl.core.algo.treetraversals.BinaryTreeTraversal
execute(BinaryTree). Method in class jdsl.core.algo.treetraversals.EvaluateExpressionTraversal
execute(BinaryTree). Method in class jdsl.core.algo.treetraversals.InorderTraversal
execute(BinaryTree). Method in class jdsl.core.algo.treetraversals.PostorderTraversal
execute(BinaryTree). Method in class jdsl.core.algo.treetraversals.PreorderTraversal
execute(BinaryTree). Method in class jdsl.core.algo.treetraversals.PrintExpressionTraversal
execute(InspectableGraph, Vertex). Method in class jdsl.core.algo.weightedgraphs.Dijkstra: Executes dijkstra's algorithm.
execute(InspectableGraph, Vertex, Object). Method in class jdsl.core.algo.graphtraversals.BiconnectivityAnalyzer: Executes the cut-vertex search and returns an enumeration of cut- vertices.
execute(InspectableGraph, Vertex, Object). Method in class jdsl.core.algo.graphtraversals.DFS: Runs the depth first search algorithm on a graph.
execute(InspectableGraph, Vertex, Object). Method in class jdsl.core.algo.graphtraversals.FindAllVerticesDFS: Runs the depth first search algorithm on a graph.
execute(InspectableGraph, Vertex, Object). Method in class jdsl.core.algo.graphtraversals.FindCycleDFS: Runs the depth first search algorithm on a graph.
execute(InspectableGraph, Vertex, Object). Method in class jdsl.core.algo.graphtraversals.FindPathDFS: Runs the depth first search algorithm on a graph.
expandExternal(Position). Method in interface jdsl.core.api.BinaryTree: The external position specified is transformed into an internal, and it gains two children.
expandExternal(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: The external position specified is transformed into an internal, and it gains two children.
expandExternal(Position). Method in class jdsl.core.ref.LinkedBinaryTree
external(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.BinaryTreeTraversal
external(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.EvaluateExpressionTraversal
external(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.InorderTraversal
external(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.PostorderTraversal
external(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.PreorderTraversal
external(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.PrintExpressionTraversal
extractElem(Object). Method in class jdsl.simple.ref.SequenceSimplePriorityQueue
extractElem(Position). Method in class jdsl.simple.ref.SequenceSimplePriorityQueue
extractKey(Position). Method in class jdsl.simple.ref.SequenceSimplePriorityQueue

F

FastEnumerationNodeSequence(). Constructor for class jdsl.core.ref.FastEnumerationNodeSequence
FastSILGraph(). Constructor for class jdsl.core.ref.FastSILGraph
finalResult. Variable in class jdsl.core.algo.treetraversals.TraversalResult
find(Object). Method in interface jdsl.core.api.Dictionary: Returns a Locator mapped to the search key.
find(Object). Method in class jdsl.core.ref.RBTree: Finds the Locator with the given key
findAll(Object). Method in interface jdsl.core.api.Dictionary: Returns an Enumeration of Locators mapped to the search key.
findAll(Object). Method in class jdsl.core.ref.RBTree: Finds all of the locators in the tree with the given key
findAllElements(Object). Method in class jdsl.simple.ref.SimpleBinarySearchTree
findAllElements(Object). Method in interface jdsl.simple.api.SimpleDictionary: Search for all the items with the specified key and return their elements.
findAllVectorEnum(Object, Position). Method in class jdsl.simple.ref.SimpleBinarySearchTree
FindAllVerticesDFS(). Constructor for class jdsl.core.algo.graphtraversals.FindAllVerticesDFS
FindCycleDFS(). Constructor for class jdsl.core.algo.graphtraversals.FindCycleDFS
findElement(Object). Method in class jdsl.simple.ref.SimpleBinarySearchTree
findElement(Object). Method in interface jdsl.simple.api.SimpleDictionary: Search for an item with the specified key.
findInSubtree(Object, Position). Method in class jdsl.core.ref.RBTree: a helper method that will return the position is key is found or the position where the key would be (i.e.
FindPathDFS(). Constructor for class jdsl.core.algo.graphtraversals.FindPathDFS
findPosition(Object, Position). Method in class jdsl.simple.ref.SimpleBinarySearchTree
finishVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.BiconnectivityAnalyzer: Called when the search has finished with the vertex.
finishVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.DFS: Called when the search has finished with the vertex.
finishVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.FindCycleDFS: Called when the search has finished with the vertex.
finishVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.FindPathDFS: Called when the search has finished with the vertex.
first(). Method in interface jdsl.simple.api.Deque: Gets the first element (without modifying the deque).
first(). Method in class jdsl.core.ref.InOrderIterator: The first position in the in-order traversal
first(). Method in class jdsl.simple.ref.MyDeque: Inspect the first element without modifying the deque.
first(). Method in class jdsl.core.ref.NodeSequence: Return the first position in the sequence
first(). Method in interface jdsl.core.api.PositionalSequence: Return the first position.
first(). Method in class jdsl.core.ref.VectorSequence: Gets the first position of this sequence.
front(). Method in class jdsl.simple.ref.ArrayQueue: Return the element which is the first in the queue
front(). Method in class jdsl.simple.ref.LinkedQueue
front(). Method in interface jdsl.simple.api.Queue: Inspect the element at the front, without removing it or otherwise changing the queue.

G

gen. Variable in class jdsl.core.algo.treetraversals.RandomTreeBuilder
GenericPosition(Container, Object). Constructor for class jdsl.core.ref.GenericPosition: Constructs a new Generic position with a given container and element
getBinaryTree(). Method in interface jdsl.core.api.BinaryTreeBased: Returns the binary tree underlying the data structure.
getBinaryTree(). Method in class jdsl.core.ref.BTHeap: Returns the underlying binary tree() in this heap.
getBinaryTree(). Method in class jdsl.simple.ref.SimpleRBTree
getCInfo(). Method in class jdsl.core.ref.RBTree
getColor(). Method in class jdsl.core.algo.treetraversals.DrawingInfo
getCutPosBetween(Position, Position). Method in class jdsl.core.algo.graphtraversals.BCTree
getLeft(). Method in class jdsl.core.ref.Node
getLocator(Vertex). Method in class jdsl.core.algo.weightedgraphs.MyDijkstra: Gets the locator of a vertex in the priority queue.
getParent(). Method in class jdsl.core.ref.Node
getRight(). Method in class jdsl.core.ref.Node
getTree(). Method in class jdsl.core.ref.BTHeap: Returns the underlying InspectableBinaryTree.
getTree(). Method in class jdsl.core.ref.RBTree: Returns the underlying tree.
getX(). Method in class jdsl.core.algo.treetraversals.DrawingInfo
getY(). Method in class jdsl.core.algo.treetraversals.DrawingInfo
graph. Variable in class jdsl.core.algo.graphtraversals.DFS: The graph being traversed.
graph. Variable in class jdsl.core.algo.weightedgraphs.Dijkstra: The graph.
graph(). Method in class jdsl.core.algo.graphtraversals.BCTree

H

hasMoreElements(). Method in class jdsl.core.ref.ArrayEnumerator: Tests if this enumeration contains more elements.
hasMoreElements(). Method in class jdsl.core.ref.VectorEnum
hasRedChild(Position). Method in class jdsl.simple.ref.SimpleRBTree
head(). Method in class jdsl.core.ref.BTNodeBinaryTree: Returns the head node of this tree.
HeapSimplePriorityQueue(Comparator). Constructor for class jdsl.simple.ref.HeapSimplePriorityQueue
height(). Method in class jdsl.simple.ref.AVLItem

I

inAdjacentVertices(Vertex). Method in class jdsl.core.ref.AMSGraphTree
inAdjacentVertices(Vertex). Method in class jdsl.core.ref.FastSILGraph
inAdjacentVertices(Vertex). Method in interface jdsl.core.api.InspectableGraph
inAdjacentVertices(Vertex). Method in class jdsl.core.ref.SILGraph: Gets all the vertices that are the source of an incoming incident edge to a vertex.
incidentEdges(Vertex). Method in class jdsl.core.ref.AMSGraphTree
incidentEdges(Vertex). Method in class jdsl.core.ref.FastSILGraph
incidentEdges(Vertex). Method in interface jdsl.core.api.InspectableGraph
incidentEdges(Vertex). Method in class jdsl.core.ref.SILGraph: Returns all edges incident to a particular vertex.
incSize(). Method in class jdsl.core.ref.VectorSequence: Provided for insertAtRank, which needs to up the size by one
inDegree(Vertex). Method in class jdsl.core.ref.AMSGraphTree
inDegree(Vertex). Method in class jdsl.core.ref.FastSILGraph
inDegree(Vertex). Method in interface jdsl.core.api.InspectableGraph
inDegree(Vertex). Method in class jdsl.core.ref.SILGraph: Gets the number of incoming incident edges of a vertex.
inIncidentEdges(Vertex). Method in class jdsl.core.ref.AMSGraphTree
inIncidentEdges(Vertex). Method in class jdsl.core.ref.FastSILGraph
inIncidentEdges(Vertex). Method in interface jdsl.core.api.InspectableGraph
inIncidentEdges(Vertex). Method in class jdsl.core.ref.SILGraph: Returns all edges incident to a particular vertex.
init(). Method in class jdsl.core.algo.weightedgraphs.MyDijkstra: Initializes Dijkstra's algorithm.
init(Object, Container, Position). Method in class jdsl.core.ref.PELocator
initPQ(Comparator). Method in class jdsl.core.algo.weightedgraphs.MyDijkstra: Initializes an empty priority queue.
initResult(). Method in class jdsl.core.algo.treetraversals.BinaryTreeTraversal
initResult(). Method in class jdsl.core.algo.graphtraversals.DFS: Initializes the result.
InOrderIterator(InspectableBinaryTree). Constructor for class jdsl.core.ref.InOrderIterator: Constructs a new InOrderIterator to iterate the given container
InorderTraversal(). Constructor for class jdsl.core.algo.treetraversals.InorderTraversal
insert(Locator). Method in class jdsl.core.ref.BTHeap: Inserts a Locator into this Container.
insert(Locator). Method in interface jdsl.core.api.KeyBasedContainer: Inserts a Locator into this Container.
insert(Locator). Method in class jdsl.core.ref.RBTree: Inserts a locator into the tree.
insert(Locator). Method in class jdsl.core.ref.SequenceLocPriorityQueue
insert(Object, Object). Method in class jdsl.core.ref.BTHeap: Inserts a <key, element> pair into this Container.
insert(Object, Object). Method in interface jdsl.core.api.KeyBasedContainer: Inserts a <key, element> pair into this Container.
insert(Object, Object). Method in class jdsl.core.ref.RBTree: Inserts a new key element pair into the tree.
insert(Object, Object). Method in class jdsl.core.ref.SequenceLocPriorityQueue
insertAfter(Position, Object). Method in class jdsl.core.ref.CircularNodeSequence: Inserts an element after a given position.
insertAfter(Position, Object). Method in interface jdsl.core.api.CircularSequence: Inserts an element after a given position.
insertAfter(Position, Object). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Create a new position with the given element and insert it after the given position, returning a reference the new position
insertAfter(Position, Object). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Create a new position with the given element and insert it after the given position, returning a reference the new position
insertAfter(Position, Object). Method in class jdsl.core.ref.NodeSequence: Create a new position with the given element and insert it after the given position, returning a reference the new position
insertAfter(Position, Object). Method in interface jdsl.core.api.PositionalSequence: Create a new position immediately after the specified position and store there the given element.
insertAfter(Position, Object). Method in class jdsl.core.ref.VCSVectorCircularSequence: Inserts an element after a given position.
insertAfter(Position, Object). Method in class jdsl.core.ref.VectorSequence: Inserts the given element before the given Position, creating and returning a new Position (before the given one) at which to store the element.
insertAtRank(int, Object). Method in interface jdsl.core.api.BookSequence: Insert a new position into the sequence at the specified rank, and store the given element into the position.
insertAtRank(int, Object). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Create a new position with the given element and insert it at the given rank.
insertAtRank(int, Object). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Create a new position with the given element and insert it at the given rank.
insertAtRank(int, Object). Method in class jdsl.core.ref.NodeSequence: Create a new position with the given element and insert it at the given rank.
insertAtRank(int, Object). Method in interface jdsl.core.api.Sequence: Insert a new position into the sequence at the specified rank, and store the given element into the position.
insertAtRank(int, Object). Method in class jdsl.core.ref.VectorSequence: Inserts the given element at the given rank, creating and returning a new Position at which to store the element.
insertBefore(Position, Object). Method in class jdsl.core.ref.CircularNodeSequence: Inserts an element before a given position.
insertBefore(Position, Object). Method in interface jdsl.core.api.CircularSequence: Inserts an element before a given position.
insertBefore(Position, Object). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Create a new position with the given element and insert it before the given position, returning a reference to the new node
insertBefore(Position, Object). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Create a new position with the given element and insert it before the given position, returning a reference to the new node
insertBefore(Position, Object). Method in class jdsl.core.ref.NodeSequence: Create a new position with the given element and insert it before the given position, returning a reference to the new node
insertBefore(Position, Object). Method in interface jdsl.core.api.PositionalSequence: Create a new position immediately before the specified position and store there the given element.
insertBefore(Position, Object). Method in class jdsl.core.ref.VCSVectorCircularSequence: Inserts an element before a given position.
insertBefore(Position, Object). Method in class jdsl.core.ref.VectorSequence: Inserts the given element before the given Position, creating and returning a new Position (before the given one) at which to store the element.
insertChild(Position, Object). Method in class jdsl.core.ref.AMSGraphTree
insertDirectedEdge(Vertex, Vertex, Object). Method in class jdsl.core.ref.AMSGraphTree
insertDirectedEdge(Vertex, Vertex, Object). Method in class jdsl.core.ref.FastSILGraph
insertDirectedEdge(Vertex, Vertex, Object). Method in interface jdsl.core.api.Graph: Inserts a new directed edge from an existing vertex to another.
insertDirectedEdge(Vertex, Vertex, Object). Method in class jdsl.core.ref.SILGraph: Inserts a directed edge into this graph.
insertEdge(Vertex, Vertex, Object). Method in class jdsl.core.ref.FastSILGraph
insertEdge(Vertex, Vertex, Object). Method in interface jdsl.core.api.Graph: Inserts a new undirected edge between two existing vertices.
insertEdge(Vertex, Vertex, Object). Method in class jdsl.core.ref.SILGraph: Inserts an edge into this graph.
insertElemAtRank(int, Object). Method in class jdsl.simple.ref.NodeRankedSequence
insertElemAtRank(int, Object). Method in interface jdsl.simple.api.RankedSequence: Insert an element at a specified rank.
insertFirst(Object). Method in interface jdsl.simple.api.Deque: Insert an element at the beginning.
insertFirst(Object). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Create a new position with the given element and insert it as the first position in the sequence.
insertFirst(Object). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Create a new position with the given element and insert it as the first position in the sequence.
insertFirst(Object). Method in class jdsl.simple.ref.MyDeque: Add an element at the front of the sequence.
insertFirst(Object). Method in class jdsl.core.ref.NodeSequence: Create a new position with the given element and insert it as the first position in the sequence.
insertFirst(Object). Method in interface jdsl.core.api.PositionalSequence: Create a new position at the beginning of the positional sequence and store there the given element.
insertFirst(Object). Method in class jdsl.core.ref.VectorSequence: Inserts the given element first in the sequence, creating and returning a new Position at which to store the element.
insertInitial(Object). Method in class jdsl.core.ref.CircularNodeSequence: Inserts an element into an empty CircularSequence.
insertInitial(Object). Method in interface jdsl.core.api.CircularSequence: Inserts an element into an empty CircularSequence.
insertInitial(Object). Method in class jdsl.core.ref.VCSVectorCircularSequence: Inserts an element into an empty CircularSequence.
insertItem(Object, Object). Method in class jdsl.core.ref.BTHeap: Add a (key,element) pair to the set maintained by the priority queue, making whatever internal adjustments are necessary.
insertItem(Object, Object). Method in class jdsl.simple.ref.HeapSimplePriorityQueue
insertItem(Object, Object). Method in interface jdsl.core.api.PriorityQueue: Add a (key,element) pair to the set maintained by the priority queue, making whatever internal adjustments are necessary.
insertItem(Object, Object). Method in class jdsl.core.ref.SequenceLocPriorityQueue
insertItem(Object, Object). Method in class jdsl.simple.ref.SequenceSimplePriorityQueue
insertItem(Object, Object). Method in class jdsl.simple.ref.SimpleAVLTree
insertItem(Object, Object). Method in class jdsl.simple.ref.SimpleBinarySearchTree
insertItem(Object, Object). Method in interface jdsl.simple.api.SimpleDictionary: Insert an item.
insertItem(Object, Object). Method in interface jdsl.simple.api.SimplePriorityQueue: Insert an item (key-element pair).
insertItem(Object, Object). Method in class jdsl.simple.ref.SimpleRBTree
insertLast(Object). Method in interface jdsl.simple.api.Deque: Insert an element at the end.
insertLast(Object). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Create a new position with the given element and insert it as the last position in the sequence.
insertLast(Object). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Create a new position with the given element and insert it as the last position in the sequence.
insertLast(Object). Method in class jdsl.simple.ref.MyDeque: Add an element at the back of the sequence.
insertLast(Object). Method in class jdsl.core.ref.NodeSequence: Create a new position with the given element and insert it as the last position in the sequence.
insertLast(Object). Method in interface jdsl.core.api.PositionalSequence: Create a new position at the end of the positional sequence and store there the given element.
insertLast(Object). Method in class jdsl.core.ref.VectorEnum
insertLast(Object). Method in class jdsl.core.ref.VectorSequence: Inserts the given element last in the sequence, creating and returning a new Position at which to store the element.
insertRoot(Object). Method in class jdsl.core.ref.AMSGraphTree
insertVertex(Object). Method in class jdsl.core.ref.AMSGraphTree: Insertion methods
insertVertex(Object). Method in class jdsl.core.ref.FastSILGraph: ____ _ / ___|_ __ __ _ _ __ | |__ | | _| '__/ _` | '_ \| '_ \ | |_| | | | (_| | |_) | | | | \____|_| \__,_| .__/|_| |_| |_|
insertVertex(Object). Method in interface jdsl.core.api.Graph: Inserts a new isolated vertex containing an object.
insertVertex(Object). Method in class jdsl.core.ref.SILGraph: Inserts a vertex into this graph.
IntegerComparator(). Constructor for class jdsl.core.ref.IntegerComparator
InvalidArgumentException(String). Constructor for class jdsl.core.api.InvalidArgumentException
invalidate(). Method in class jdsl.core.ref.PELocator
InvalidAttributeException(String). Constructor for class jdsl.core.api.InvalidAttributeException
InvalidComparatorException(String). Constructor for class jdsl.core.api.InvalidComparatorException
InvalidContainerException(String). Constructor for class jdsl.core.api.InvalidContainerException
InvalidEdgeException(String). Constructor for class jdsl.core.api.InvalidEdgeException
InvalidElementException(String). Constructor for class jdsl.core.api.InvalidElementException
InvalidKeyException(String). Constructor for class jdsl.core.api.InvalidKeyException: Constructs an InvalidKeyException with the specified detail message.
InvalidLocatorException(String). Constructor for class jdsl.core.api.InvalidLocatorException
InvalidMethodCallException(String). Constructor for class jdsl.core.api.InvalidMethodCallException
InvalidPositionException(String). Constructor for class jdsl.core.api.InvalidPositionException
InvalidTreeException(String). Constructor for class jdsl.core.api.InvalidTreeException
isBlack(Position). Method in class jdsl.core.ref.RBColorInfo
isComparable(Object). Method in interface jdsl.core.api.Comparator: Tests whether this comparator can compare this object
isComparable(Object). Method in class jdsl.core.ref.IntegerComparator: Tests if an Object can be compared by this comparator.
isComparable(Object). Method in class jdsl.core.ref.StringComparator: Tests if o is a String and not null.
isConnected(InspectableGraph). Static method in class jdsl.core.algo.graphtraversals.ConnectivityTest
isContained(). Method in class jdsl.core.ref.AlwaysInvalidLocator: Throws an InvalidLocatorException when an attempt is made to find out if this locator is contained or not.
isContained(). Method in interface jdsl.core.api.Locator
isContained(). Method in class jdsl.core.ref.LocItem
isContained(). Method in class jdsl.core.ref.PELocator
isContained(). Method in class jdsl.core.ref.RBTLocator
isCutEdge(Edge). Method in class jdsl.core.algo.graphtraversals.BCTree
isCutPosition(Position). Method in class jdsl.core.algo.graphtraversals.BCTree
isCutVertex(Vertex). Method in class jdsl.core.algo.graphtraversals.BCTree
isDirected(Edge). Method in class jdsl.core.ref.AMSGraphTree
isDirected(Edge). Method in class jdsl.core.ref.FastSILGraph
isDirected(Edge). Method in interface jdsl.core.api.InspectableGraph
isDirected(Edge). Method in class jdsl.core.ref.SILGraph: Tests if an edge is directed.
isDone(). Method in class jdsl.core.algo.graphtraversals.BiconnectivityAnalyzer: It is necessary to complete the entire traversal, so this method always returns false.
isDone(). Method in class jdsl.core.algo.graphtraversals.DFS: Tests if the depth first search is done.
isDone(). Method in class jdsl.core.algo.graphtraversals.FindCycleDFS: Tests if the depth first search is done.
isDone(). Method in class jdsl.core.algo.graphtraversals.FindPathDFS: Tests if the depth first search is done.
isDoubleBlack(Position). Method in class jdsl.core.ref.RBColorInfo
isEmpty(). Method in class jdsl.core.ref.AMSGraphTree
isEmpty(). Method in class jdsl.simple.ref.ArrayQueue: This function returns true if and only if the queue is empty
isEmpty(). Method in class jdsl.simple.ref.ArrayStack: This function returns true if and only if the stack is empty
isEmpty(). Method in class jdsl.core.algo.graphtraversals.BCTree
isEmpty(). Method in class jdsl.core.ref.BTHeap: Tests if the container is empty.
isEmpty(). Method in class jdsl.core.ref.BTNodeBinaryTree: Tests if this container is empty.
isEmpty(). Method in class jdsl.core.ref.CircularNodeSequence: Tests if this container is empty.
isEmpty(). Method in interface jdsl.simple.api.Deque: Tests if this deque is empty
isEmpty(). Method in class jdsl.simple.ref.DequeStack
isEmpty(). Method in class jdsl.core.ref.FastSILGraph
isEmpty(). Method in class jdsl.simple.ref.HeapSimplePriorityQueue
isEmpty(). Method in class jdsl.core.ref.LinkedBinaryTree
isEmpty(). Method in class jdsl.simple.ref.LinkedQueue
isEmpty(). Method in class jdsl.simple.ref.LinkedStack
isEmpty(). Method in class jdsl.simple.ref.MyDeque: This function returns true if and only if the deque is empty
isEmpty(). Method in class jdsl.core.ref.NodeSequence: Return true iff the sequence is empty
isEmpty(). Method in interface jdsl.simple.api.Queue: Return true if and only if the queue is empty.
isEmpty(). Method in class jdsl.core.ref.RBTree
isEmpty(). Method in class jdsl.simple.ref.SequenceSimplePriorityQueue
isEmpty(). Method in class jdsl.simple.ref.SequenceStack
isEmpty(). Method in class jdsl.core.ref.SILGraph: Tests if this container is empty.
isEmpty(). Method in class jdsl.simple.ref.SimpleBinarySearchTree
isEmpty(). Method in interface jdsl.simple.api.SimpleContainer: Tests if the container is empty.
isEmpty(). Method in interface jdsl.simple.api.Stack: Tests if the stack is empty
isEmpty(). Method in class jdsl.core.ref.VCSVectorCircularSequence: Tests if this container is empty.
isEmpty(). Method in class jdsl.core.ref.VectorSequence: Tests if the container is empty.
isEqualTo(Object, Object). Method in interface jdsl.core.api.Comparator: Tests equality of two objects in the universe over which this comparator is defined.
isEqualTo(Object, Object). Method in class jdsl.core.ref.IntegerComparator: Tests if one Integer is equal to another.
isEqualTo(Object, Object). Method in class jdsl.core.ref.StringComparator: Tests if two strings are equal.
isExternal(Position). Method in class jdsl.core.ref.AMSGraphTree
isExternal(Position). Method in class jdsl.core.algo.graphtraversals.BCTree
isExternal(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: Checks if a given Position is an external node in this tree.
isExternal(Position). Method in interface jdsl.core.api.InspectableTree
isExternal(Position). Method in class jdsl.core.ref.LinkedBinaryTree
isGreaterThan(Object, Object). Method in interface jdsl.core.api.Comparator: Tests strict order of two objects in the universe over which this comparator is defined.
isGreaterThan(Object, Object). Method in class jdsl.core.ref.IntegerComparator: Tests if one Integer is greater than another.
isGreaterThan(Object, Object). Method in class jdsl.core.ref.StringComparator: Tests if a String is greater than another
isGreaterThanOrEqualTo(Object, Object). Method in interface jdsl.core.api.Comparator: Tests non-strict order of two objects in the universe over which this comparator is defined.
isGreaterThanOrEqualTo(Object, Object). Method in class jdsl.core.ref.IntegerComparator: Tests if one Integer is greater than or equal to another.
isGreaterThanOrEqualTo(Object, Object). Method in class jdsl.core.ref.StringComparator: Tests if a String is greater than or equal to another
isInternal(Position). Method in class jdsl.core.ref.AMSGraphTree
isInternal(Position). Method in class jdsl.core.algo.graphtraversals.BCTree
isInternal(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: Checks if a given Position if an internal node in this tree.
isInternal(Position). Method in interface jdsl.core.api.InspectableTree
isInternal(Position). Method in class jdsl.core.ref.LinkedBinaryTree
isLessThan(Object, Object). Method in interface jdsl.core.api.Comparator: Tests strict order of two objects in the universe over which this comparator is defined.
isLessThan(Object, Object). Method in class jdsl.core.ref.IntegerComparator: Tests if one Integer is less than another.
isLessThan(Object, Object). Method in class jdsl.core.ref.StringComparator: Tests if a String is less than another
isLessThanOrEqualTo(Object, Object). Method in interface jdsl.core.api.Comparator: Tests non-strict order of two objects in the universe over which this comparator is defined.
isLessThanOrEqualTo(Object, Object). Method in class jdsl.core.ref.IntegerComparator: Tests if one Integer is less than or equal to another.
isLessThanOrEqualTo(Object, Object). Method in class jdsl.core.ref.StringComparator: Tests if a String is greater than another
isMarked(Edge). Method in class jdsl.core.algo.graphtraversals.DFS: Tests if an edge has been marked.
isMarked(Vertex). Method in class jdsl.core.algo.graphtraversals.DFS: Tests if a vertex has been marked.
isMarked(Vertex). Method in class jdsl.core.algo.graphtraversals.NumConnectedComponents
isPosRed(Position). Method in class jdsl.simple.ref.SimpleRBTree
isRed(). Method in class jdsl.simple.ref.RBTItem
isRed(Position). Method in class jdsl.core.ref.RBColorInfo
isRoot(Position). Method in class jdsl.core.ref.AMSGraphTree: InspectableTree methods
isRoot(Position). Method in class jdsl.core.algo.graphtraversals.BCTree: InspectableTree methods
isRoot(Position). Method in class jdsl.core.ref.BTNodeBinaryTree
isRoot(Position). Method in interface jdsl.core.api.InspectableTree
isRoot(Position). Method in class jdsl.core.ref.LinkedBinaryTree
isValid(). Method in class jdsl.core.ref.PELocator
isValid(). Method in class jdsl.core.ref.RBTLocator
Item(Object, Object). Constructor for class jdsl.simple.ref.Item

K

key(). Method in class jdsl.core.ref.AlwaysInvalidLocator: Throws an InvalidLocatorException when an attempt is made to access the key of this locator.
key(). Method in class jdsl.simple.ref.Item
key(). Method in class jdsl.simple.ref.KeyElementPair
key(). Method in interface jdsl.core.api.Locator
key(). Method in class jdsl.core.ref.PELocator
key(). Method in class jdsl.core.ref.RBTLocator
key(Position). Method in class jdsl.simple.ref.SimpleBinarySearchTree
KeyElementPair(Object, Object). Constructor for class jdsl.simple.ref.KeyElementPair
keys(). Method in class jdsl.core.ref.BTHeap: Returns an Enumeration of all the keys within this Container.
keys(). Method in interface jdsl.core.api.KeyBasedContainer: Returns an enumeration of all of the keys of all the locators in the Container.
keys(). Method in class jdsl.core.ref.RBTree: Returns an Enumeration of all the keys within this Container.
keys(). Method in class jdsl.core.ref.SequenceLocPriorityQueue
keys(). Method in class jdsl.simple.ref.SimpleBinarySearchTree
keys(). Method in interface jdsl.simple.api.SimpleDictionary: Report the keys of all the items stored in the dictionary.

L

label_. Variable in class jdsl.core.ref.AlwaysInvalidLocator
last(). Method in interface jdsl.simple.api.Deque: Gets the last element (without modifying the deque).
last(). Method in class jdsl.core.ref.InOrderIterator: The last position in the in-order traversal
last(). Method in class jdsl.simple.ref.MyDeque: Inspect the last element without modifying the deque.
last(). Method in class jdsl.core.ref.NodeSequence: Return the last position in the sequence
last(). Method in interface jdsl.core.api.PositionalSequence: Return the last position.
last(). Method in class jdsl.core.ref.VectorSequence: Gets the last position of this sequence.
left(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.BinaryTreeTraversal
left(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.PreorderTraversal
left(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.PrintExpressionTraversal
leftChild(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: Returns the left child of a Position
leftChild(Position). Method in interface jdsl.core.api.InspectableBinaryTree: Gets the left child of p
leftChild(Position). Method in class jdsl.core.ref.LinkedBinaryTree
leftResult. Variable in class jdsl.core.algo.treetraversals.TraversalResult
link(Position, BinaryTree). Method in interface jdsl.core.api.BinaryTree: Position mustBeExternal is removed from the tree.
link(Position, BinaryTree). Method in class jdsl.core.ref.BTNodeBinaryTree: Position mustBeExternal is removed from the tree.
link(Position, BinaryTree). Method in class jdsl.core.ref.LinkedBinaryTree
link(Position, Tree). Method in interface jdsl.core.api.Tree: Position mustBeExternal is removed from the tree, and its locator is made uncontained.
LinkedBinaryTree(). Constructor for class jdsl.core.ref.LinkedBinaryTree
LinkedQueue(). Constructor for class jdsl.simple.ref.LinkedQueue
LinkedStack(). Constructor for class jdsl.simple.ref.LinkedStack
ListBubbleSort(). Constructor for class jdsl.core.algo.sorts.ListBubbleSort
ListInsertionSort(). Constructor for class jdsl.core.algo.sorts.ListInsertionSort
ListMergeSort(). Constructor for class jdsl.core.algo.sorts.ListMergeSort
ListQuickSort(). Constructor for class jdsl.core.algo.sorts.ListQuickSort
ListSelectionSortInPlace(). Constructor for class jdsl.core.algo.sorts.ListSelectionSortInPlace
ListSelectionSortWithTemp(). Constructor for class jdsl.core.algo.sorts.ListSelectionSortWithTemp
locators. Variable in class jdsl.core.algo.weightedgraphs.MyDijkstra
locators(). Method in class jdsl.core.ref.BTHeap: Returns an Enumeration of all the Locators within this Container.
locators(). Method in interface jdsl.core.api.KeyBasedContainer: Returns an Enumeration of all the Locators within this Container.
locators(). Method in class jdsl.core.ref.RBTree: Returns an enumeration of colors
locators(). Method in class jdsl.core.ref.SequenceLocPriorityQueue
locInsert(LocItem). Method in class jdsl.core.ref.SequenceLocPriorityQueue
locRemove(Locator). Method in class jdsl.core.ref.SequenceLocPriorityQueue

M

main(String[]). Static method in class jdsl.core.algo.treetraversals.EvalTest
main(String[]). Static method in class jdsl.core.algo.treetraversals.EvalTest2
main(String[]). Static method in class jdsl.core.algo.treetraversals.EvalTest3
main(String[]). Static method in class jdsl.core.algo.treetraversals.EvalTest4
main(String[]). Static method in class jdsl.core.algo.treetraversals.TraverseTest
makeBlack(). Method in class jdsl.simple.ref.RBTItem
makeLocator(Object, Object). Method in class jdsl.core.ref.BTHeap: For when you need a locator that can be inserted into this KeyBasedContainer but don't want to insert it quite yet.
makeLocator(Object, Object). Method in interface jdsl.core.api.KeyBasedContainer: For when you need a locator that can be inserted into this KeyBasedContainer but don't want to insert it quite yet.
makeLocator(Object, Object). Method in class jdsl.core.ref.RBTree: Produces a Locator that is ready to be inserted.
makeLocator(Object, Object). Method in class jdsl.core.ref.SequenceLocPriorityQueue
makeRed(). Method in class jdsl.simple.ref.RBTItem
makeUndirected(Edge). Method in class jdsl.core.ref.FastSILGraph
makeUndirected(Edge). Method in interface jdsl.core.api.Graph: Makes a directed edge undirected.
makeUndirected(Edge). Method in class jdsl.core.ref.SILGraph: Makes a directed edge undirected.
mark(Edge). Method in class jdsl.core.algo.graphtraversals.DFS: Marks an edge as traversed.
mark(Vertex). Method in class jdsl.core.algo.graphtraversals.DFS: Called when a vertex needs to be marked as visited.
mark(Vertex). Method in class jdsl.core.algo.graphtraversals.NumConnectedComponents
markedEdges. Variable in class jdsl.core.algo.graphtraversals.DFS: A table of marked edges.
markedVerts. Variable in class jdsl.core.algo.graphtraversals.DFS: A table of marked vertices.
markedVerts. Variable in class jdsl.core.algo.graphtraversals.NumConnectedComponents
merge(Sequence, Sequence, Comparator, Sequence). Method in class jdsl.core.algo.sorts.ListMergeSort
min(). Method in class jdsl.core.ref.BTHeap: Allows access to element with first priority without removing it from the PriorityQueue.
min(). Method in interface jdsl.core.api.PriorityQueue: Allows access to element with first priority without removing it from the PriorityQueue.
min(). Method in class jdsl.core.ref.SequenceLocPriorityQueue
minElement(). Method in class jdsl.core.ref.BTHeap: Inspect the element (not the key) with first priority, without modifying the priority queue.
minElement(). Method in class jdsl.simple.ref.HeapSimplePriorityQueue
minElement(). Method in interface jdsl.core.api.PriorityQueue: Inspect the element (not the key) with first priority, without modifying the priority queue.
minElement(). Method in class jdsl.simple.ref.SequenceSimplePriorityQueue
minElement(). Method in interface jdsl.simple.api.SimplePriorityQueue: Inspect an element (not a key) with smallest key, without modifying the priority queue.
minKey(). Method in class jdsl.core.ref.BTHeap: Inspect the key with first priority, without modifying the priority queue.
minKey(). Method in class jdsl.simple.ref.HeapSimplePriorityQueue
minKey(). Method in interface jdsl.core.api.PriorityQueue: Inspect the key with first priority, without modifying the priority queue.
minKey(). Method in class jdsl.simple.ref.SequenceSimplePriorityQueue
minKey(). Method in interface jdsl.simple.api.SimplePriorityQueue: Inspect a smallest key (not its element), without modifying the priority queue.
MultiplicationOperator(). Constructor for class jdsl.core.algo.treetraversals.MultiplicationOperator
MutablePosition(). Constructor for class jdsl.core.ref.MutablePosition
MyDeque(). Constructor for class jdsl.simple.ref.MyDeque
MyDijkstra(). Constructor for class jdsl.core.algo.weightedgraphs.MyDijkstra

N

newContainer(). Method in class jdsl.core.ref.AMSGraphTree: Container methods
newContainer(). Method in class jdsl.core.algo.graphtraversals.BCTree: Container methods
newContainer(). Method in class jdsl.core.ref.BTHeap
newContainer(). Method in class jdsl.core.ref.BTNodeBinaryTree: Returns a new, empty instance of this container.
newContainer(). Method in class jdsl.core.ref.CircularNodeSequence: Constructs a new CircularNodeSequence.
newContainer(). Method in interface jdsl.core.api.Container: Instantiates another container of the same class (without knowing the class).
newContainer(). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Make a new container of this type
newContainer(). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Make a new container of this type
newContainer(). Method in class jdsl.core.ref.FastSILGraph: ____ _ _ / ___|___ _ __ | |_ __ _(_)_ __ ___ _ __ | | / _ \| '_ \| __/ _` | | '_ \ / _ \ '__| | |__| (_) | | | | || (_| | | | | | __/ | \____\___/|_| |_|\__\__,_|_|_| |_|\___|_|
newContainer(). Method in class jdsl.core.ref.LinkedBinaryTree
newContainer(). Method in class jdsl.core.ref.NodeSequence: Make a new container of this type
newContainer(). Method in class jdsl.core.ref.RBTree
newContainer(). Method in class jdsl.core.ref.RestructurableNodeBinaryTree: Returns a new RestructurableNodeBinaryTree.
newContainer(). Method in class jdsl.core.ref.SequenceLocPriorityQueue
newContainer(). Method in class jdsl.core.ref.SILGraph: Constructs a new, empty Graph.
newContainer(). Method in class jdsl.core.ref.VCSVectorCircularSequence: Constructs a new CircularNodeSequence.
newContainer(). Method in class jdsl.core.ref.VectorSequence: Returns a new, empty VectorSequence.
next(). Method in class jdsl.core.ref.InOrderIterator: Gets the next Position
nextElement(). Method in class jdsl.core.ref.ArrayEnumerator: Returns the next element of this enumeration.
nextElement(). Method in class jdsl.core.ref.VectorEnum
nextInsert(). Method in class jdsl.core.ref.BTHeap: Retrieves the Position that the Heap will insert at next.
nextInsert(Position). Method in class jdsl.core.ref.BTHeap: Changes the position that the Heap will insert at next
NO_SUCH_KEY. Static variable in interface jdsl.core.api.Dictionary: Locator returned by find(.) when the key requested is not present in the Dictionary.
NO_SUCH_KEY. Static variable in interface jdsl.simple.api.SimpleDictionary: Special element returned by the search and removal methods when no item with the specified key is stored in the dictionary.
Node(). Constructor for class jdsl.core.ref.Node
Node(Object, Node, Node, Node, Container). Constructor for class jdsl.core.ref.Node
nodeOf(Position). Method in class jdsl.core.algo.graphtraversals.BCTree
NodeRankedSequence(). Constructor for class jdsl.simple.ref.NodeRankedSequence
NodeSequence(). Constructor for class jdsl.core.ref.NodeSequence
NOSUCHPOSITION. Static variable in class jdsl.core.algo.graphtraversals.BCTree: Returned by getCutPosBetween(Position, Position) if no cut-position exists between the two parameter positions.
NotEmptyContainerException(String). Constructor for class jdsl.core.api.NotEmptyContainerException: Creates a new exception with a given message.
numComponents(InspectableGraph). Method in class jdsl.core.algo.graphtraversals.NumConnectedComponents
NumConnectedComponents(). Constructor for class jdsl.core.algo.graphtraversals.NumConnectedComponents
numEdges(). Method in class jdsl.core.ref.AMSGraphTree
numEdges(). Method in class jdsl.core.ref.FastSILGraph
numEdges(). Method in interface jdsl.core.api.InspectableGraph
numEdges(). Method in class jdsl.core.ref.SILGraph: Gets the number of edges in this graph.
numVertices(). Method in class jdsl.core.ref.AMSGraphTree: InspectableGraph methods
numVertices(). Method in class jdsl.core.ref.FastSILGraph: ___ _ _ _ |_ _|_ __ ___ _ __ ___ ___| |_ __ _| |__ | | ___ | || '_ \/ __| '_ \ / _ \/ __| __/ _` | '_ \| |/ _ \ | || | | \__ \ |_) | __/ (__| || (_| | |_) | | __/ |___|_| |_|___/ .__/ \___|\___|\__\__,_|_.__/|_|\___| |_|
numVertices(). Method in interface jdsl.core.api.InspectableGraph
numVertices(). Method in class jdsl.core.ref.SILGraph: Gets the number of vertices in this graph.

O

operation(Integer, Integer). Method in class jdsl.core.algo.treetraversals.AdditionOperator
operation(Integer, Integer). Method in class jdsl.core.algo.treetraversals.MultiplicationOperator
operation(Integer, Integer). Method in interface jdsl.core.algo.treetraversals.OperatorInfo
opposite(Vertex, Edge). Method in class jdsl.core.ref.AMSGraphTree
opposite(Vertex, Edge). Method in class jdsl.core.ref.FastSILGraph
opposite(Vertex, Edge). Method in interface jdsl.core.api.InspectableGraph
opposite(Vertex, Edge). Method in class jdsl.core.ref.SILGraph: Gets the end vertex of Edge e that is different from Vertex v.
origin(Edge). Method in class jdsl.core.ref.AMSGraphTree
origin(Edge). Method in class jdsl.core.ref.FastSILGraph
origin(Edge). Method in interface jdsl.core.api.InspectableGraph
origin(Edge). Method in class jdsl.core.ref.SILGraph: Gets the origin of an edge.
outAdjacentVertices(Vertex). Method in class jdsl.core.ref.AMSGraphTree
outAdjacentVertices(Vertex). Method in class jdsl.core.ref.FastSILGraph
outAdjacentVertices(Vertex). Method in interface jdsl.core.api.InspectableGraph
outAdjacentVertices(Vertex). Method in class jdsl.core.ref.SILGraph: Gets all the vertices that are the destination of an outgoing incident edge to a vertex.
outDegree(Vertex). Method in class jdsl.core.ref.AMSGraphTree
outDegree(Vertex). Method in class jdsl.core.ref.FastSILGraph
outDegree(Vertex). Method in interface jdsl.core.api.InspectableGraph
outDegree(Vertex). Method in class jdsl.core.ref.SILGraph: Gets the number of outgoing incident edges of a vertex.
outIncidentEdges(Vertex). Method in class jdsl.core.ref.AMSGraphTree
outIncidentEdges(Vertex). Method in class jdsl.core.ref.FastSILGraph
outIncidentEdges(Vertex). Method in interface jdsl.core.api.InspectableGraph
outIncidentEdges(Vertex). Method in class jdsl.core.ref.SILGraph: Gets all edges incident from a particular vertex.

P

parent(Position). Method in class jdsl.core.ref.AMSGraphTree
parent(Position). Method in class jdsl.core.algo.graphtraversals.BCTree
parent(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: Returns the parent of a Position in the tree.
parent(Position). Method in interface jdsl.core.api.InspectableTree
parent(Position). Method in class jdsl.core.ref.LinkedBinaryTree
path. Variable in class jdsl.core.algo.graphtraversals.FindCycleDFS
path. Variable in class jdsl.core.algo.graphtraversals.FindPathDFS
PELocator(). Constructor for class jdsl.core.ref.PELocator
PELocator(Object, Container, Position). Constructor for class jdsl.core.ref.PELocator
pop(). Method in class jdsl.simple.ref.ArrayStack: Remove the top element on the stack, moving all other elements up.
pop(). Method in class jdsl.simple.ref.DequeStack
pop(). Method in class jdsl.simple.ref.LinkedStack
pop(). Method in class jdsl.simple.ref.SequenceStack
pop(). Method in interface jdsl.simple.api.Stack: Remove the top element.
position(). Method in class jdsl.core.ref.LocItem
position(). Method in class jdsl.core.ref.PELocator
position(). Method in class jdsl.core.ref.RBTLocator
positions. Variable in class jdsl.core.algo.treetraversals.InorderTraversal
positions. Variable in class jdsl.core.algo.treetraversals.PostorderTraversal
positions. Variable in class jdsl.core.algo.treetraversals.PreorderTraversal
positions(). Method in class jdsl.core.ref.AMSGraphTree: PositionalContainer methods
positions(). Method in class jdsl.core.algo.graphtraversals.BCTree: PositionalContainer methods
positions(). Method in class jdsl.core.ref.BTNodeBinaryTree: Returns the Positions of this BinaryTree in preorder order.
positions(). Method in class jdsl.core.ref.CircularNodeSequence: Returns all the positions in this container.
positions(). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Returns an enumeration of the positions in this sequence
positions(). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Returns an enumeration of the positions in this sequence
positions(). Method in class jdsl.core.ref.FastSILGraph: PositionalContainer methods
positions(). Method in class jdsl.core.ref.LinkedBinaryTree
positions(). Method in class jdsl.core.ref.NodeSequence: Returns an enumeration of the positions in this sequence
positions(). Method in interface jdsl.core.api.PositionalContainer: Return an Enumeration of the positions in the container.
positions(). Method in class jdsl.core.ref.SILGraph: Gets all the positions in this graph.
positions(). Method in class jdsl.core.ref.VCSVectorCircularSequence: Returns all the positions in this container.
positions(). Method in class jdsl.core.ref.VectorSequence: Gets all the Positions in this container, in order.
PostorderTraversal(). Constructor for class jdsl.core.algo.treetraversals.PostorderTraversal
PreorderTraversal(). Constructor for class jdsl.core.algo.treetraversals.PreorderTraversal
prev(). Method in class jdsl.core.ref.InOrderIterator: Returns the in-order-previous of the given locator, including the leafs Throws a BoundaryViolationException if c is the first node in inorder traversal
PrintExpressionTraversal(). Constructor for class jdsl.core.algo.treetraversals.PrintExpressionTraversal
printOutElements(). Method in class jdsl.core.ref.VectorEnum
push(Object). Method in class jdsl.simple.ref.ArrayStack: Put an element onto the top of the stack, and move all previously inserted elements down.
push(Object). Method in class jdsl.simple.ref.DequeStack
push(Object). Method in class jdsl.simple.ref.LinkedStack
push(Object). Method in class jdsl.simple.ref.SequenceStack
push(Object). Method in interface jdsl.simple.api.Stack: Insert an element at the top.

Q

Q. Variable in class jdsl.core.algo.weightedgraphs.Dijkstra: A priority queue used by dijkstra's algorithm.
QueueEmptyException(String). Constructor for class jdsl.simple.api.QueueEmptyException
QueueFullException(String). Constructor for class jdsl.simple.ref.QueueFullException

R

randomBinaryTree(int). Method in class jdsl.core.algo.treetraversals.RandomTreeBuilder
randomColor(). Method in class jdsl.core.algo.treetraversals.RandomTreeBuilder
randomInteger(int, int). Method in class jdsl.core.algo.treetraversals.RandomTreeBuilder
RandomTreeBuilder(). Constructor for class jdsl.core.algo.treetraversals.RandomTreeBuilder
rankOf(Position). Method in interface jdsl.core.api.BookSequence: Return the rank of the specified position.
rankOf(Position). Method in class jdsl.core.ref.NodeSequence: Return the rank of the given position
rankOf(Position). Method in interface jdsl.core.api.Sequence: Return the rank of the specified position.
rankOf(Position). Method in class jdsl.core.ref.VectorSequence: Gets the rank of a position.
RBColorInfo(). Constructor for class jdsl.core.ref.RBColorInfo
RBTItem(Object, Object, boolean). Constructor for class jdsl.simple.ref.RBTItem
RBTLocator(Object, Object, Container, Position). Constructor for class jdsl.core.ref.RBTLocator
RBTree(Comparator). Constructor for class jdsl.core.ref.RBTree: The class's constructor.
recolor(Position). Method in class jdsl.core.ref.RBTree
recolorAfterRemove(Position). Method in class jdsl.core.ref.RBTree
RED. Static variable in interface jdsl.core.ref.RBColorConstants
redChild(Position). Method in class jdsl.simple.ref.SimpleRBTree
remedyDoubleBlack(Position). Method in class jdsl.simple.ref.SimpleRBTree
remedyDoubleRed(Position). Method in class jdsl.simple.ref.SimpleRBTree
remove(Locator). Method in class jdsl.core.ref.BTHeap: Removes an element from this Container.
remove(Locator). Method in interface jdsl.core.api.KeyBasedContainer: Removes an element from this Container.
remove(Locator). Method in class jdsl.core.ref.RBTree
remove(Locator). Method in class jdsl.core.ref.SequenceLocPriorityQueue
remove(Object). Method in class jdsl.simple.ref.SimpleAVLTree
remove(Object). Method in class jdsl.simple.ref.SimpleBinarySearchTree
remove(Object). Method in interface jdsl.simple.api.SimpleDictionary: Remove an item with the specified key.
remove(Object). Method in class jdsl.simple.ref.SimpleRBTree
remove(Position). Method in class jdsl.core.ref.CircularNodeSequence: Removes the specified position.
remove(Position). Method in interface jdsl.core.api.CircularSequence: Removes the specified position.
remove(Position). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Remove this position from the sequence
remove(Position). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Remove this position from the sequence
remove(Position). Method in class jdsl.core.ref.NodeSequence: Remove this position from the sequence
remove(Position). Method in interface jdsl.core.api.PositionalSequence: Remove and invalidate the specified position.
remove(Position). Method in class jdsl.core.ref.VCSVectorCircularSequence: Removes the specified position.
remove(Position). Method in class jdsl.core.ref.VectorSequence: Removes and invalidates the given Position, returning the element stored at it.
removeAboveExternal(Position). Method in interface jdsl.core.api.BinaryTree: The parent of Position mustBeExternal is deleted, and the sibling subtree of mustBeExternal takes the parent's place as the left/right child of the parent's parent.
removeAboveExternal(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: The parent of Position mustBeExternal is deleted, and the sibling subtree of mustBeExternal takes the parent's place as the left/right child of the parent's parent.
removeAboveExternal(Position). Method in class jdsl.core.ref.LinkedBinaryTree
removeAfter(Position). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Removes after p
removeAfter(Position). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Removes after p
removeAfter(Position). Method in class jdsl.core.ref.NodeSequence: Removes after p
removeAfter(Position). Method in interface jdsl.core.api.PositionalSequence: Removes the position after a specified position
removeAfter(Position). Method in class jdsl.core.ref.VectorSequence
removeAll(Object). Method in class jdsl.simple.ref.SimpleBinarySearchTree
removeAll(Object). Method in interface jdsl.simple.api.SimpleDictionary: Remove all the items with the specified key.
removeAtRank(int). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Removes the position at rank i
removeAtRank(int). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Removes the position at rank i
removeAtRank(int). Method in class jdsl.core.ref.NodeSequence: Removes the position at rank i
removeAtRank(int). Method in interface jdsl.core.api.Sequence: Remove the position at the designated rank
removeAtRank(int). Method in class jdsl.core.ref.VectorSequence: Removes an element at a particular rank.
removeBefore(Position). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Removes before p
removeBefore(Position). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Removes before p
removeBefore(Position). Method in class jdsl.core.ref.NodeSequence: Removes before p
removeBefore(Position). Method in interface jdsl.core.api.PositionalSequence: Removes the position before a specified position
removeBefore(Position). Method in class jdsl.core.ref.VectorSequence
removeEdge(Edge). Method in class jdsl.core.ref.FastSILGraph
removeEdge(Edge). Method in interface jdsl.core.api.Graph: Removes an edge.
removeEdge(Edge). Method in class jdsl.core.ref.SILGraph: Removes an edge from this graph.
removeElemAtRank(int). Method in class jdsl.simple.ref.NodeRankedSequence
removeElemAtRank(int). Method in interface jdsl.simple.api.RankedSequence: Remove the element at a specified rank.
removeFirst(). Method in interface jdsl.simple.api.Deque: Remove the element at the beginning.
removeFirst(). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Removes the first position
removeFirst(). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Removes the first position
removeFirst(). Method in class jdsl.simple.ref.MyDeque: Delete the element at the front of the sequence.
removeFirst(). Method in class jdsl.core.ref.NodeSequence: Removes the first position
removeFirst(). Method in interface jdsl.core.api.PositionalSequence: Removes the first position in the sequence
removeFirst(). Method in class jdsl.core.ref.VectorSequence: Removes the first element of the sequence.
removeLast(). Method in interface jdsl.simple.api.Deque: Remove the element at the end.
removeLast(). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Removes the last position
removeLast(). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Removes the last position
removeLast(). Method in class jdsl.simple.ref.MyDeque: Delete the element at the back of the sequence.
removeLast(). Method in class jdsl.core.ref.NodeSequence: Removes the last position
removeLast(). Method in interface jdsl.core.api.PositionalSequence: Removes the last position of the sequence
removeLast(). Method in class jdsl.core.ref.VectorSequence: Removes the last element of the sequence.
removeMinElement(). Method in class jdsl.core.ref.BTHeap: Remove a (key,element) pair with first priority, making whatever internal adjustments are necessary.
removeMinElement(). Method in class jdsl.simple.ref.HeapSimplePriorityQueue
removeMinElement(). Method in interface jdsl.core.api.PriorityQueue: Remove a (key,element) pair with first priority, making whatever internal adjustments are necessary.
removeMinElement(). Method in class jdsl.core.ref.SequenceLocPriorityQueue
removeMinElement(). Method in class jdsl.simple.ref.SequenceSimplePriorityQueue
removeMinElement(). Method in interface jdsl.simple.api.SimplePriorityQueue: Remove an item (key,element) with smallest key.
removeVertex(Vertex). Method in class jdsl.core.ref.FastSILGraph
removeVertex(Vertex). Method in interface jdsl.core.api.Graph: Deletes a vertex and all its incident edges.
removeVertex(Vertex). Method in class jdsl.core.ref.SILGraph: Removes a vertex from this graph.
replace(Position, Object). Method in class jdsl.core.ref.AMSGraphTree
replace(Position, Object). Method in class jdsl.core.algo.graphtraversals.BCTree
replace(Position, Object). Method in class jdsl.core.ref.BTNodeBinaryTree: Replaces the element of a Position.
replace(Position, Object). Method in class jdsl.core.ref.CircularNodeSequence: Replace the element at the specified position with a new element.
replace(Position, Object). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Replace the element of the given position with the new element and return the old value of element
replace(Position, Object). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Replace the element of the given position with the new element and return the old value of element
replace(Position, Object). Method in class jdsl.core.ref.FastSILGraph
replace(Position, Object). Method in class jdsl.core.ref.LinkedBinaryTree
replace(Position, Object). Method in class jdsl.core.ref.NodeSequence: Replace the element of the given position with the new element and return the old value of element
replace(Position, Object). Method in interface jdsl.core.api.PositionalContainer: Replace the element at the specified position with a new element.
replace(Position, Object). Method in class jdsl.core.ref.SILGraph: Replaces the object associated with a position.
replace(Position, Object). Method in class jdsl.core.ref.VCSVectorCircularSequence: Replace the element at the specified position with a new element.
replace(Position, Object). Method in class jdsl.core.ref.VectorSequence: Replaces the element at a position with a new element.
replaceElemAtRank(int, Object). Method in class jdsl.simple.ref.NodeRankedSequence
replaceElemAtRank(int, Object). Method in interface jdsl.simple.api.RankedSequence: Replace the element at a specified rank.
replaceElement(Locator, Object). Method in class jdsl.core.ref.BTHeap: Takes constant time -- even in key-based containers, since the element can be changed independently of the key.
replaceElement(Locator, Object). Method in interface jdsl.core.api.KeyBasedContainer: Takes constant time -- even in key-based containers, since the element can be changed independently of the key.
replaceElement(Locator, Object). Method in class jdsl.core.ref.RBTree: Replaces the element of the passed in locator
replaceElement(Locator, Object). Method in class jdsl.core.ref.SequenceLocPriorityQueue
replaceKey(Locator, Object). Method in class jdsl.core.ref.BTHeap: Changes the mapping of a Locator's element to a new key.
replaceKey(Locator, Object). Method in interface jdsl.core.api.KeyBasedContainer: Changes the mapping of a Locator's element to a new key.
replaceKey(Locator, Object). Method in class jdsl.core.ref.RBTree: Replaces the key of the passed in locator
replaceKey(Locator, Object). Method in class jdsl.core.ref.SequenceLocPriorityQueue
replaceSubtree(Position, BinaryTree). Method in interface jdsl.core.api.BinaryTree: Swaps a subtree of the tree on which the method is called with a "subtree" passed in.
replaceSubtree(Position, BinaryTree). Method in class jdsl.core.ref.BTNodeBinaryTree: Swaps a subtree of the tree on which the method is called with a "subtree" passed in.
replaceSubtree(Position, BinaryTree). Method in class jdsl.core.ref.LinkedBinaryTree
replaceSubtree(Position, Tree). Method in interface jdsl.core.api.Tree: Swap out the tree rooted at subtreeRoot and replace it with the newSubtree passed in.
RestructurableNodeBinaryTree(). Constructor for class jdsl.core.ref.RestructurableNodeBinaryTree: Construct a new restructurable binary tree.
restructure(Position). Method in interface jdsl.core.api.RestructurableBinaryTree: Applies a rotation to the given position, its parent, and its grandparent.
restructure(Position). Method in class jdsl.core.ref.RestructurableNodeBinaryTree: Restructures the tree at a given position.
result(). Method in class jdsl.core.algo.graphtraversals.BiconnectivityAnalyzer: Not used in this algorithm, but required by the abstract template.
result(). Method in class jdsl.core.algo.graphtraversals.DFS: Returns the result of the search.
result(TraversalResult). Method in class jdsl.core.algo.treetraversals.BinaryTreeTraversal
reverseDirection(Edge). Method in class jdsl.core.ref.FastSILGraph
reverseDirection(Edge). Method in interface jdsl.core.api.Graph: Reverse the direction of an edge.
reverseDirection(Edge). Method in class jdsl.core.ref.SILGraph: Reverses the direction of an edge.
right(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.BinaryTreeTraversal
right(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.EvaluateExpressionTraversal
right(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.PostorderTraversal
right(Position, TraversalResult). Method in class jdsl.core.algo.treetraversals.PrintExpressionTraversal
rightChild(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: Returns the right child of a Position
rightChild(Position). Method in interface jdsl.core.api.InspectableBinaryTree: Gets the right child of p.
rightChild(Position). Method in class jdsl.core.ref.LinkedBinaryTree
rightResult. Variable in class jdsl.core.algo.treetraversals.TraversalResult
root(). Method in class jdsl.core.ref.AMSGraphTree
root(). Method in class jdsl.core.algo.graphtraversals.BCTree
root(). Method in class jdsl.core.ref.BTNodeBinaryTree: Returns the root, or top node, of the tree.
root(). Method in interface jdsl.core.api.InspectableTree: Note that trees always have at least one external node, so they always have a root.
root(). Method in class jdsl.core.ref.LinkedBinaryTree
rotation(Position). Method in class jdsl.core.ref.RBTree: silly method that just calls restructure on the restructurable BT

S

seq. Variable in class jdsl.simple.ref.SequenceSimplePriorityQueue
SequenceLocPriorityQueue(Comparator). Constructor for class jdsl.core.ref.SequenceLocPriorityQueue
SequencePosition(Container, Object, int). Constructor for class jdsl.core.ref.SequencePosition: Constructor, needs to receive the container that is holding this position as well as the object that it should hold and its index
SequenceSimplePriorityQueue(Comparator). Constructor for class jdsl.simple.ref.SequenceSimplePriorityQueue
SequenceStack(). Constructor for class jdsl.simple.ref.SequenceStack
SequenceStack(Object). Constructor for class jdsl.simple.ref.SequenceStack
setBlack(Position). Method in class jdsl.simple.ref.SimpleRBTree
setColor(boolean). Method in class jdsl.simple.ref.RBTItem
setColor(Color). Method in class jdsl.core.algo.treetraversals.DrawingInfo
setColor(int). Method in class jdsl.core.ref.RBTLocator
setColor(Position, boolean). Method in class jdsl.simple.ref.SimpleRBTree
setComparator(Comparator). Method in class jdsl.core.ref.BTHeap: This method establishes a ContainerInterfaces.Comparator that an ordered container should use to compare its elements.
setComparator(Comparator). Method in interface jdsl.core.api.ComparatorBased: This method establishes a ContainerInterfaces.Comparator that an ordered container should use to compare its elements.
setComparator(Comparator). Method in class jdsl.core.ref.RBTree: Sets the Comparator to be used in this container.
setContainer(Container). Method in class jdsl.core.ref.GenericPosition: Sets the container for this position.
setContainer(Container). Method in class jdsl.core.ref.LocItem
setContainer(Container). Method in class jdsl.core.ref.Node
setContainer(Container). Method in class jdsl.core.ref.PELocator
setContainer(Container). Method in class jdsl.core.ref.RBTLocator
setCurrent(Position). Method in class jdsl.core.ref.InOrderIterator: Sets the Iterator's current Locator to newCurrent.
setDirectionFrom(Edge, Vertex). Method in class jdsl.core.ref.FastSILGraph
setDirectionFrom(Edge, Vertex). Method in interface jdsl.core.api.Graph: Sets the direction of an edge away from a vertex.
setDirectionFrom(Edge, Vertex). Method in class jdsl.core.ref.SILGraph: Sets the direction of an edge away from a vertex.
setDirectionTo(Edge, Vertex). Method in class jdsl.core.ref.FastSILGraph
setDirectionTo(Edge, Vertex). Method in interface jdsl.core.api.Graph: Sets the direction of an edge towards a vertex.
setDirectionTo(Edge, Vertex). Method in class jdsl.core.ref.SILGraph: Sets the direction of an edge to a vertex.
setDistance(Vertex, int). Method in class jdsl.core.algo.weightedgraphs.MyDijkstra: Sets the distance to reach a vertex from it origin.
setElement(Object). Method in class jdsl.core.ref.AMSGTEdge
setElement(Object). Method in class jdsl.core.ref.AMSGTVertex
setElement(Object). Method in class jdsl.core.ref.GenericPosition: Sets the element for this position.
setElement(Object). Method in class jdsl.simple.ref.Item
setElement(Object). Method in class jdsl.core.ref.MutablePosition
setElement(Object). Method in class jdsl.core.ref.Node
setElement(Object). Method in class jdsl.core.ref.PELocator
setElement(Object). Method in class jdsl.core.ref.RBTLocator
setHeight(int). Method in class jdsl.simple.ref.AVLItem
setKey(Object). Method in class jdsl.simple.ref.Item
setKey(Object). Method in class jdsl.core.ref.RBTLocator
setLeft(Node). Method in class jdsl.core.ref.Node
setLocator(Vertex, Locator). Method in class jdsl.core.algo.weightedgraphs.MyDijkstra: Sets the locator of a vertex in the priority queue.
setParent(Node). Method in class jdsl.core.ref.Node
setPosition(Position). Method in class jdsl.core.ref.LocItem
setPosition(Position). Method in class jdsl.core.ref.PELocator
setPosition(Position). Method in class jdsl.core.ref.RBTLocator
setRed(Position). Method in class jdsl.simple.ref.SimpleRBTree
setRight(Node). Method in class jdsl.core.ref.Node
setULE(Edge). Method in class jdsl.core.ref.AMSGTEdge
setULV(Vertex). Method in class jdsl.core.ref.AMSGTVertex
setWeight(Edge, int). Method in class jdsl.core.algo.weightedgraphs.MyDijkstra
setX(int). Method in class jdsl.core.algo.treetraversals.DrawingInfo
setY(int). Method in class jdsl.core.algo.treetraversals.DrawingInfo
sibling(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: Returns the sibling of a Position
sibling(Position). Method in interface jdsl.core.api.InspectableBinaryTree: Gets the sibling Position of the Position passed in.
sibling(Position). Method in class jdsl.core.ref.LinkedBinaryTree
siblings(Position). Method in class jdsl.core.ref.AMSGraphTree
siblings(Position). Method in class jdsl.core.algo.graphtraversals.BCTree
siblings(Position). Method in class jdsl.core.ref.BTNodeBinaryTree: The returned Enumeration is guaranteed to give the siblings in left-to-right order.
siblings(Position). Method in interface jdsl.core.api.InspectableTree: The returned Enumeration is guaranteed to give the siblings in order from left to right.
siblings(Position). Method in class jdsl.core.ref.LinkedBinaryTree
SILEdge(Container, Object, Vertex, Vertex, boolean). Constructor for class jdsl.core.ref.SILEdge: Construct a new edge for use in a SimpleIncidenceListGraph.
SILGraph(). Constructor for class jdsl.core.ref.SILGraph: Constructs a new, empty Graph.
SimpleAVLTree(Comparator). Constructor for class jdsl.simple.ref.SimpleAVLTree
SimpleBinarySearchTree(Comparator). Constructor for class jdsl.simple.ref.SimpleBinarySearchTree
SimpleRBTree(Comparator). Constructor for class jdsl.simple.ref.SimpleRBTree
size(). Method in class jdsl.core.ref.AMSGraphTree
size(). Method in class jdsl.simple.ref.ArrayQueue: Return the size of the queue, that is the number of elements it has.
size(). Method in class jdsl.simple.ref.ArrayStack: Return the size of the stack, that is the number of elements it has.
size(). Method in class jdsl.core.algo.graphtraversals.BCTree
size(). Method in class jdsl.core.ref.BTHeap: Number of elements in the container.
size(). Method in class jdsl.core.ref.BTNodeBinaryTree: Returns the size of this container.
size(). Method in class jdsl.core.ref.CircularNodeSequence: Gets the number of elements in this container.
size(). Method in interface jdsl.simple.api.Deque: Gets the number of elements.
size(). Method in class jdsl.simple.ref.DequeStack
size(). Method in class jdsl.core.ref.FastSILGraph
size(). Method in class jdsl.simple.ref.HeapSimplePriorityQueue
size(). Method in class jdsl.core.ref.LinkedBinaryTree
size(). Method in class jdsl.simple.ref.LinkedQueue
size(). Method in class jdsl.simple.ref.LinkedStack
size(). Method in class jdsl.simple.ref.MyDeque: Return the size of the deque, that is the number of elements it has.
size(). Method in class jdsl.core.ref.NodeSequence: Return the number of elements in the sequence
size(). Method in interface jdsl.simple.api.Queue: Return the number of elements.
size(). Method in class jdsl.core.ref.RBTree
size(). Method in class jdsl.simple.ref.SequenceSimplePriorityQueue
size(). Method in class jdsl.simple.ref.SequenceStack
size(). Method in class jdsl.core.ref.SILGraph: Gets the size of this graph.
size(). Method in class jdsl.simple.ref.SimpleBinarySearchTree
size(). Method in interface jdsl.simple.api.SimpleContainer: Return the number of elements stored in the container, where each element is counted according to is multiplicity.
size(). Method in interface jdsl.simple.api.Stack: Return the number of elements.
size(). Method in class jdsl.core.ref.VCSVectorCircularSequence: Gets the number of elements in this container.
size(). Method in class jdsl.core.ref.VectorSequence: Gets the size of this container.
size(int). Method in class jdsl.core.ref.BTHeap: Changes the current size.
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ArrayBubbleSort: Perform a bubble-sort, assuming atRank(i) is O(1) -- i.e.
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ArrayInsertionSort: Perform insertion-sort, assuming the Sequence is based on a vector (O(1) atRank).
The sort proceeds by looking at each element in turn, and moving them down to where they belong in the sorted part of the sequence (the beginning).
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ArrayMergeSort: Performs a merge-sort, assuming the Sequence is vector-based.
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ArrayQuickSort
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ArraySelectionSort: Perform selection-sort, assuming the Sequence is based on a vector.
The sort proceeds by finding the minimum of what's left, and inserting it at the end of the sorted part of the sequence.
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ListBubbleSort: Perform a bubble-sort, assuming the sequence is based on a doubly-linked list.
First inserts a sentinel to avoid needing to check if we're swapping with the outer loop locator.
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ListInsertionSort: Perform insertion-sort, assuming the Sequence is based on a doubly-linked list.
The sort proceeds by looking at each element in S, removing it, and inserting it in its place in a sorted sequence on the side.
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ListMergeSort
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ListQuickSort: Does quicksort on a linked-list.
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ListSelectionSortInPlace: Perform selection-sort, assuming the Sequence is a doubly-linked list.
This sort is an analogue of the array-based selection-sort.
sort(Sequence, Comparator). Method in class jdsl.core.algo.sorts.ListSelectionSortWithTemp: Perform selection-sort, assuming the Sequence is a double-linked list.
This implementation repeatedly removes the minimum element from S and inserts it at the end of a temporary sequence, which is somewhat more elegant than the array-based version.
sort(Sequence, Comparator). Method in interface jdsl.core.algo.sorts.SortObject
splice(Position, CircularSequence, Position). Method in class jdsl.core.ref.CircularNodeSequence: Merges in another CircularNodeSequence after a given position.
splice(Position, CircularSequence, Position). Method in interface jdsl.core.api.CircularSequence: Merges in another CircularSequence after a given position.
splice(Position, CircularSequence, Position). Method in class jdsl.core.ref.VCSVectorCircularSequence: Merges in another CircularNodeSequence after a given position.
split(Position, Position). Method in class jdsl.core.ref.CircularNodeSequence: Snips out a chain of nodes from this CircularSequence, repairs this CircularSequence, and makes a new CircularSequence with the snipped-out nodes.
split(Position, Position). Method in interface jdsl.core.api.CircularSequence: Snips out a chain of nodes from this CircularSequence, repairs this CircularSequence, and makes a new CircularSequence with the snipped-out nodes.
split(Position, Position). Method in class jdsl.core.ref.VCSVectorCircularSequence: Snips out a chain of nodes from this CircularSequence, repairs this CircularSequence, and makes a new CircularSequence with the snipped-out nodes.
StackEmptyException(String). Constructor for class jdsl.simple.api.StackEmptyException
StackFullException(String). Constructor for class jdsl.simple.ref.StackFullException
startingPosition(). Method in class jdsl.core.ref.CircularNodeSequence: Returns an arbitrary starting Position in this CircularSequence.
startingPosition(). Method in interface jdsl.core.api.CircularSequence: Since there's no first() or last() in a circular sequence, a method is needed that will give a position -- any position -- in the circular sequence, to get things started.
startingPosition(). Method in class jdsl.core.ref.VCSVectorCircularSequence: Returns an arbitrary starting Position in this CircularSequence.
startVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.BiconnectivityAnalyzer: Called when a vertex is visited.
startVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.DFS: Called when a vertex is visited.
startVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.FindAllVerticesDFS: Called when a vertex is visited.
startVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.FindCycleDFS: Called when a vertex is visited.
startVisit(Vertex). Method in class jdsl.core.algo.graphtraversals.FindPathDFS: Called when a vertex is visited.
StringComparator(). Constructor for class jdsl.core.ref.StringComparator
swap(Position, Position). Method in class jdsl.core.ref.AMSGraphTree
swap(Position, Position). Method in class jdsl.core.algo.graphtraversals.BCTree
swap(Position, Position). Method in class jdsl.core.ref.BTNodeBinaryTree: Swaps the elements associated with the two Positions, leaving the Positions themselves "where" they were.
swap(Position, Position). Method in class jdsl.core.ref.CircularNodeSequence: Swaps the elements at two specified positions.
swap(Position, Position). Method in class jdsl.core.ref.DumbEnumerationNodeSequence: Swap elements of two positions
swap(Position, Position). Method in class jdsl.core.ref.FastEnumerationNodeSequence: Swap elements of two positions
swap(Position, Position). Method in class jdsl.core.ref.FastSILGraph
swap(Position, Position). Method in class jdsl.core.ref.LinkedBinaryTree
swap(Position, Position). Method in class jdsl.core.ref.NodeSequence: Swap elements of two positions
swap(Position, Position). Method in interface jdsl.core.api.PositionalContainer: Swaps the elements at two specified positions.
swap(Position, Position). Method in class jdsl.core.ref.SILGraph: Swaps the elements of two positions.
swap(Position, Position). Method in class jdsl.simple.ref.SimpleBinarySearchTree
swap(Position, Position). Method in class jdsl.simple.ref.SimpleRBTree
swap(Position, Position). Method in class jdsl.core.ref.VCSVectorCircularSequence: Swaps the elements at two specified positions.
swap(Position, Position). Method in class jdsl.core.ref.VectorSequence: Swaps the elements associated with the two Positions, leaving the Positions themselves "where" they were.
swapColor(Position, Position). Method in class jdsl.simple.ref.SimpleRBTree

T

targetVert. Variable in class jdsl.core.algo.graphtraversals.FindPathDFS
tester. Static variable in class jdsl.core.algo.graphtraversals.ConnectivityTest
tester. Variable in class jdsl.core.algo.graphtraversals.NumConnectedComponents
top(). Method in class jdsl.simple.ref.ArrayStack: Look at the top element on the stack, without removing it or otherwise affecting the stack.
top(). Method in class jdsl.simple.ref.DequeStack
top(). Method in class jdsl.simple.ref.LinkedStack
top(). Method in class jdsl.simple.ref.SequenceStack
top(). Method in interface jdsl.simple.api.Stack: Inspect the top element, without removing it or otherwise modifying the stack.
toString(). Method in class jdsl.core.algo.treetraversals.AdditionOperator
toString(). Method in class jdsl.core.ref.AlwaysInvalidLocator: Returns a string representation of this AlwaysInvalidLocator.
toString(). Method in class jdsl.core.algo.treetraversals.MultiplicationOperator
toString(). Method in class jdsl.core.algo.treetraversals.VariableInfo
traversal(). Method in class jdsl.core.ref.InOrderIterator: Generates the inorder traversal of the tree.
TraversalResult(). Constructor for class jdsl.core.algo.treetraversals.TraversalResult
traverseBack(Edge, Vertex). Method in class jdsl.core.algo.graphtraversals.BiconnectivityAnalyzer: Called when a back edge is traversed.
traverseBack(Edge, Vertex). Method in class jdsl.core.algo.graphtraversals.DFS: Called when a back edge is traversed.
traverseBack(Edge, Vertex). Method in class jdsl.core.algo.graphtraversals.FindCycleDFS: Called when a back edge is traversed.
traverseDiscovery(Edge, Vertex). Method in class jdsl.core.algo.graphtraversals.BiconnectivityAnalyzer: Called when a discovery edge is traversed.
traverseDiscovery(Edge, Vertex). Method in class jdsl.core.algo.graphtraversals.DFS: Called when a discovery edge is traversed.
traverseNode(Position). Method in class jdsl.core.algo.treetraversals.BinaryTreeTraversal
TraverseTest(). Constructor for class jdsl.core.algo.treetraversals.TraverseTest
tree. Variable in class jdsl.core.algo.treetraversals.BinaryTreeTraversal
tree. Variable in class jdsl.core.algo.treetraversals.RandomTreeBuilder
tree(). Method in class jdsl.core.ref.BTHeap: Retrieve the BinaryTree.

U

ulEdge(). Method in class jdsl.core.ref.AMSGTEdge
ulVertex(). Method in class jdsl.core.ref.AMSGTVertex
UncontainedLocatorException(String). Constructor for class jdsl.core.api.UncontainedLocatorException
undirectedEdges(). Method in class jdsl.core.ref.AMSGraphTree
undirectedEdges(). Method in class jdsl.core.ref.FastSILGraph
undirectedEdges(). Method in interface jdsl.core.api.InspectableGraph
undirectedEdges(). Method in class jdsl.core.ref.SILGraph: Gets all the undirected edges in this graph.
updateIndicesStartingAt(int). Method in class jdsl.core.ref.VectorSequence
upheap(Position). Method in class jdsl.core.ref.BTHeap: Performs the upheap operation starting at p.

V

variable(). Method in class jdsl.core.algo.treetraversals.VariableInfo
VariableInfo(int). Constructor for class jdsl.core.algo.treetraversals.VariableInfo
VCSVectorCircularSequence(). Constructor for class jdsl.core.ref.VCSVectorCircularSequence: Constructs a new sequence with an initial capacity of 12.
VCSVectorCircularSequence(int). Constructor for class jdsl.core.ref.VCSVectorCircularSequence: Constructs a new sequence with an underlying Vector of size initialCapacity.
VCSVectorCircularSequence(int, int). Constructor for class jdsl.core.ref.VCSVectorCircularSequence: Constructs a new sequence with an underlying Vector of size initialCapacity.
VectorEnum(). Constructor for class jdsl.core.ref.VectorEnum
VectorSequence(). Constructor for class jdsl.core.ref.VectorSequence: Constructs a new Sequence with an initial capacity of 4.
VectorSequence(int). Constructor for class jdsl.core.ref.VectorSequence: Constructs a new sequence with an underlying Vector of size initialCapacity.
VectorSequence(int, int). Constructor for class jdsl.core.ref.VectorSequence: Constructs a new sequence with an underlying Vector of size initialCapacity.
vertices. Variable in class jdsl.core.algo.graphtraversals.FindAllVerticesDFS
vertices(). Method in class jdsl.core.ref.AMSGraphTree
vertices(). Method in class jdsl.core.ref.FastSILGraph
vertices(). Method in interface jdsl.core.api.InspectableGraph
vertices(). Method in class jdsl.core.ref.SILGraph: Gets all the vertices in this graph.
visitResult. Variable in class jdsl.core.algo.graphtraversals.DFS: The result of the traversal.

W

weight(Edge). Method in class jdsl.core.algo.weightedgraphs.MyDijkstra: Returns the weight of an edge.
weights. Variable in class jdsl.core.algo.weightedgraphs.MyDijkstra