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

A

AbstractArrayIterator - class jdsl.core.ref.AbstractArrayIterator.

A class abstracting the common parts of ArrayPositionIterator and ArrayLocatorIterator.

AbstractArrayIterator(Accessor[]) - Constructor for class jdsl.core.ref.AbstractArrayIterator

Uses the array to store the elements that this iterator traverses.

AbstractArrayIterator(Accessor[], int) - Constructor for class jdsl.core.ref.AbstractArrayIterator

Traverses through the array until the first num elements have been returned.

AbstractComparator - class jdsl.core.ref.AbstractComparator.

An abstract class implementing some methods of the Comparator interface.

AbstractComparator() - Constructor for class jdsl.core.ref.AbstractComparator

AbstractDictionary - class jdsl.core.ref.AbstractDictionary.

An abstraction of the Dictionary implementations that ensures the existence of a method to insert Locators back into the data structure.

AbstractDictionary() - Constructor for class jdsl.core.ref.AbstractDictionary

AbstractGraph - class jdsl.graph.ref.AbstractGraph.

An implementation of many of the methods of InspectableGraph in terms of a few primitives.

AbstractGraph() - Constructor for class jdsl.graph.ref.AbstractGraph

AbstractGraph.OO_to_O_MergerIterator - class jdsl.graph.ref.AbstractGraph.OO_to_O_MergerIterator.

AbstractGraph.OO_to_O_MergerIterator(ObjectIterator, ObjectIterator) - Constructor for class jdsl.graph.ref.AbstractGraph.OO_to_O_MergerIterator

Assumes neither iterator is null

AbstractPositionalContainer - class jdsl.core.ref.AbstractPositionalContainer.

An abstract positional container that others may extend if they do not wish to deal with some of the more mundane aspects of positional containers and/or if they wish to avoid implementing themselves some of the methods of container that aren't terribly pertinent to a PositionalContainer.

AbstractPositionalContainer() - Constructor for class jdsl.core.ref.AbstractPositionalContainer

AbstractTopologicalSort - class jdsl.graph.algo.AbstractTopologicalSort.

This abstract class is the foundation for both types of topological sorts, that is, the standard variety where each vertex is given a unique number, and the level-numbering variety in which numbers attached to vertices are not unique.

AbstractTopologicalSort() - Constructor for class jdsl.graph.algo.AbstractTopologicalSort

Constructor.

Accessor - interface jdsl.core.api.Accessor.

All JDSL core containers provide a way to access their internal structure; Accessor is the interface that embodies this concept.

AnachronismException - exception jdsl.graph.algo.AnachronismException.

This is an exception thrown specifically by the DFS to signify that an internal error has arisen in the computation of start/finish times.

AnachronismException(String) - Constructor for class jdsl.graph.algo.AnachronismException

A constructor that takes a String that (hopefully) contains a relevant message about the circumstances under which this exception was thrown.

AnachronismException(String, Throwable) - Constructor for class jdsl.graph.algo.AnachronismException

AnachronismException(Throwable) - Constructor for class jdsl.graph.algo.AnachronismException

ArrayHeap - class jdsl.core.ref.ArrayHeap.

An array implementation of a heap.

ArrayHeap(Comparator) - Constructor for class jdsl.core.ref.ArrayHeap

Creates a new heap.

ArrayHeap(Comparator, boolean) - Constructor for class jdsl.core.ref.ArrayHeap

Creates a new heap.

ArrayHeap(Comparator, int, boolean) - Constructor for class jdsl.core.ref.ArrayHeap

Creates a new heap.

ArrayLocatorIterator - class jdsl.core.ref.ArrayLocatorIterator.

An array-based locator iterator.

ArrayLocatorIterator(Locator[]) - Constructor for class jdsl.core.ref.ArrayLocatorIterator

Uses the array to store the elements that this iterator traverses.

ArrayLocatorIterator(Locator[], int) - Constructor for class jdsl.core.ref.ArrayLocatorIterator

Traverses through the array, which is not copied, until num elements have been returned.

ArrayMergeSort - class jdsl.core.algo.sorts.ArrayMergeSort.

Performs a merge-sort in O(n log n) time, provided that the atRank(int) method of the Sequence works in O(1) time.

ArrayMergeSort() - Constructor for class jdsl.core.algo.sorts.ArrayMergeSort

ArrayObjectIterator - class jdsl.core.ref.ArrayObjectIterator.

An array-based object iterator.

ArrayObjectIterator(Object[]) - Constructor for class jdsl.core.ref.ArrayObjectIterator

Uses the array to store the elements that this iterator traverses.

ArrayObjectIterator(Object[], int) - Constructor for class jdsl.core.ref.ArrayObjectIterator

Traverses through the array, which is not copied, until num elements have been returned.

ArrayPositionIterator - class jdsl.core.ref.ArrayPositionIterator.

An array-based positional iterator.

ArrayPositionIterator(Position[]) - Constructor for class jdsl.core.ref.ArrayPositionIterator

Uses the array to store the elements that this iterator traverses.

ArrayPositionIterator(Position[], int) - Constructor for class jdsl.core.ref.ArrayPositionIterator

Traverses through the array, which is not copied, until num elements have been returned.

ArrayQuickSort - class jdsl.core.algo.sorts.ArrayQuickSort.

Performs an in-place quicksort in expected O(n log n) time, provided that the atRank(int) method of the Sequence operates in O(1) time.

ArrayQuickSort() - Constructor for class jdsl.core.algo.sorts.ArrayQuickSort

ArraySequence - class jdsl.core.ref.ArraySequence.

A Sequence implemented on top of an array.

ArraySequence() - Constructor for class jdsl.core.ref.ArraySequence

The default constructor for ArraySequence Initial array capacity defaults to 16.

ArraySequence(int) - Constructor for class jdsl.core.ref.ArraySequence

Creates an empty Sequence.

ArraySequence(boolean) - Constructor for class jdsl.core.ref.ArraySequence

Creates an empty Sequence.

ArraySequence(int, boolean) - Constructor for class jdsl.core.ref.ArraySequence

Creates an empty Sequence.

Assertion - class jdsl.core.ref.Assertion.

Deprecated. Starting with Java 2 version 1.4 assertions are part of the language, and thus this class is no longer necessary.

AssertionException - exception jdsl.core.ref.AssertionException.

Deprecated. Starting with Java 2 version 1.4 assertions are part of the language, and thus this class is no longer necessary.

AssertionException() - Constructor for class jdsl.core.ref.AssertionException

Deprecated.

AssertionException(String) - Constructor for class jdsl.core.ref.AssertionException

Deprecated.

AssertionException(String, Throwable) - Constructor for class jdsl.core.ref.AssertionException

Deprecated.

AssertionException(Throwable) - Constructor for class jdsl.core.ref.AssertionException

Deprecated.

aCommonVertex(Edge, Edge) - Method in interface jdsl.graph.api.InspectableGraph

aCommonVertex(Edge, Edge) - Method in class jdsl.graph.ref.AbstractGraph

Built on endVertices(.)

aConnectingEdge(Vertex, Vertex) - Method in interface jdsl.graph.api.InspectableGraph

Gives an arbitrary edge from among those connecting the two specified vertices.

aConnectingEdge(Vertex, Vertex) - Method in class jdsl.graph.ref.AbstractGraph

Built on incidentEdges(.)

aVertex() - Method in interface jdsl.graph.api.InspectableGraph

aVertex() - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

adjacentVertices(Vertex) - Method in interface jdsl.graph.api.InspectableGraph

Lists all vertices adjacent to a particular vertex by any kind of edge, with repeats corresponding to parallel edges.

adjacentVertices(Vertex, int) - Method in interface jdsl.graph.api.InspectableGraph

Lists all vertices adjacent to a particular vertex by all edges of the types specified.

adjacentVertices(Vertex) - Method in class jdsl.graph.ref.AbstractGraph

Built on incidentEdges(.)

adjacentVertices(Vertex, int) - Method in class jdsl.graph.ref.AbstractGraph

Built on incidentEdges(.)

after(Locator) - Method in interface jdsl.core.api.InspectableOrderedDictionary

Returns the Locator that is sequentially after another Locator in this Container.

after(Position) - Method in interface jdsl.core.api.InspectableSequence

The next position in the sequence.

after(Position) - Method in class jdsl.core.ref.ArraySequence

O(1) time.

after(Position) - Method in class jdsl.core.ref.NodeSequence

O(1) time

after(Locator) - Method in class jdsl.core.ref.RedBlackTree

Takes O(logN) time -- may need to traverse the height of the tree to find the next note that we do not return color-locators in the leaves -- we only return key locators.

allVertices() - Method in class jdsl.graph.algo.IntegerPrimTemplate

Can be overridden to consider a subset of the vertices in the graph, although I can't think of any reason to do so.

anEdge() - Method in interface jdsl.graph.api.InspectableGraph

anEdge() - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

anIncidentEdge(Vertex) - Method in interface jdsl.graph.api.InspectableGraph

anIncidentEdge(Vertex, int) - Method in interface jdsl.graph.api.InspectableGraph

anIncidentEdge(Vertex) - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

anIncidentEdge(Vertex, int) - Method in class jdsl.graph.ref.IncidenceListGraph

O(degree)

areAdjacent(Vertex, Vertex) - Method in interface jdsl.graph.api.InspectableGraph

areAdjacent(Edge, Edge) - Method in interface jdsl.graph.api.InspectableGraph

Checks whether two edges have at least one common endpoint.

areAdjacent(Vertex, Vertex) - Method in class jdsl.graph.ref.AbstractGraph

Built on incidentEdges(.)

areAdjacent(Edge, Edge) - Method in class jdsl.graph.ref.AbstractGraph

Built on endVertices(.)

areIncident(Vertex, Edge) - Method in interface jdsl.graph.api.InspectableGraph

areIncident(Vertex, Edge) - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

arrayToSequence(Object[], Sequence) - Static method in class jdsl.core.util.Converter

Places the contents of an array into a sequence, preserving order.

atRank(int) - Method in interface jdsl.core.api.InspectableSequence

Get the position in the sequence with the specified rank

atRank(int) - Method in class jdsl.core.ref.ArraySequence

O(1) time.

atRank(int) - Method in class jdsl.core.ref.NodeSequence

O(1) time if the positions_ cache is valid (no modifications since cache was generated) O(N) if cache is invalid (must traverse up to half of Sequence)

attachVertex(Vertex, Object, Object) - Method in interface jdsl.graph.api.Graph

Attaches a new vertex, containing an object, to an existing vertex by inserting a new undirected edge.

attachVertex(Vertex, Object, Object) - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

attachVertexFrom(Vertex, Object, Object) - Method in interface jdsl.graph.api.Graph

Attaches a new vertex, containing an object, by inserting a new directed edge from an existing vertex.

attachVertexFrom(Vertex, Object, Object) - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

attachVertexTo(Vertex, Object, Object) - Method in interface jdsl.graph.api.Graph

Attaches a new vertex, containing an object, by inserting a new directed edge to an existing vertex.

attachVertexTo(Vertex, Object, Object) - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

attributes() - Method in interface jdsl.core.api.Decorable

Returns an iterator over all the attributes attached to this decorable.

attributes() - Method in class jdsl.core.ref.HashtableDecorable

attributes() - Method in class jdsl.graph.api.Edge.NONEEdge

attributes() - Method in class jdsl.graph.api.Vertex.NONEVertex

B

BACK_EDGE - Static variable in class jdsl.graph.algo.DFS

Constant signifying that a marked edge is a back edge.

BLACK - Static variable in class jdsl.core.ref.RedBlackTree

BOUNDARY_VIOLATION - Static variable in interface jdsl.core.api.InspectableOrderedDictionary

Object returned from all four methodsof InspectableOrderedDictionary to indicate that the user tried to access before the first element of the dictionary or after the last.

BinaryTree - interface jdsl.core.api.BinaryTree.

A modifiable tree in which each node has either zero or two children.

BoundaryViolationException - exception jdsl.core.api.BoundaryViolationException.

A BoundaryViolationException indicates that a Container's edges were trespassed somehow: off the end, over the top, beyond the bottom, etc.

BoundaryViolationException(String) - Constructor for class jdsl.core.api.BoundaryViolationException

BoundaryViolationException(String, Throwable) - Constructor for class jdsl.core.api.BoundaryViolationException

BoundaryViolationException(Throwable) - Constructor for class jdsl.core.api.BoundaryViolationException

badWeight(Vertex, Edge, int) - Method in class jdsl.graph.algo.IntegerPrimTemplate

Can be overridden to handle edges that have zero or negative weights.

before(Locator) - Method in interface jdsl.core.api.InspectableOrderedDictionary

Returns the Locator that is sequentially before another Locator in this Container.

before(Position) - Method in interface jdsl.core.api.InspectableSequence

The previous position in the sequence.

before(Position) - Method in class jdsl.core.ref.ArraySequence

O(1) time.

before(Position) - Method in class jdsl.core.ref.NodeSequence

O(1) time

before(Locator) - Method in class jdsl.core.ref.RedBlackTree

Takes O(logN) time -- may need to traverse the height of the tree to find the next note that we do not return color-locators in the leaves -- we only return key locators.

C

CROSS_EDGE - Static variable in class jdsl.graph.algo.DFS

Constant signifying that a marked edge is a cross edge.

ComparableComparator - class jdsl.core.ref.ComparableComparator.

Implementation of JDSL's Comparator interface in terms of the JDK's Comparable interface.

ComparableComparator() - Constructor for class jdsl.core.ref.ComparableComparator

Comparator - interface jdsl.core.api.Comparator.

Defines a total ordering for a set of objects.

ComparatorExtender - class jdsl.core.ref.ComparatorExtender.

Takes a java.util.Comparator and adapts it to the jdsl.core.api.Comparator.

ComparatorExtender(Comparator) - Constructor for class jdsl.core.ref.ComparatorExtender

Constructs a new comparator which adapts the given java.util.Comparator.

ComparatorReverser - class jdsl.core.ref.ComparatorReverser.

Takes a Comparator and reverses the ordering with respect to which the elements are compared.

ComparatorReverser(Comparator) - Constructor for class jdsl.core.ref.ComparatorReverser

Container - interface jdsl.core.api.Container.

The common interface for all the mutable containers in JDSL.

Converter - class jdsl.core.util.Converter.

Provides for conversion of JDSL data structures to java.util Collections and Java base types and for conversion of java.util Collections to JDSL data structures.

Converter() - Constructor for class jdsl.core.util.Converter

CoreException - exception jdsl.core.api.CoreException.

This is the class from which all exceptions of the core package are descended.

CoreException(String) - Constructor for class jdsl.core.api.CoreException

CoreException(String, Throwable) - Constructor for class jdsl.core.api.CoreException

CoreException(Throwable) - Constructor for class jdsl.core.api.CoreException

capacity() - Method in class jdsl.core.ref.HashtableDecorable

Gets the capacity of this hashtable.

case1(Position, Position) - Method in class jdsl.core.ref.RedBlackTree

Takes O(1) time Implements case 1, the Restructuring case Protected for purposes of allowing snapshots during visualization

case2(Position) - Method in class jdsl.core.ref.RedBlackTree

Takes O(1) time Implements case 2, the Recoloring case Protected for purposes of allowing snapshots during visualization

case3(Position) - Method in class jdsl.core.ref.RedBlackTree

Takes O(1) time Implements case 3, the Adjustment case Protected for purposes of allowing snapshots during visualization

check(boolean) - Static method in class jdsl.core.ref.Assertion

Deprecated. Never use this method to indicate bad user input; this method is for asserting internal correctness of the implementation only.

check(boolean, String) - Static method in class jdsl.core.ref.Assertion

Deprecated. Never use this method to indicate bad user input; this method is for asserting internal correctness of the implementation only.

checkBeforeStart() - Method in class jdsl.core.ref.AbstractArrayIterator

checkDoubleRed(Position) - Method in class jdsl.core.ref.RedBlackTree

Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree Check for double reds, then rotate or promote if necessary Protected for purposes of allowing snapshots during visualization

checkPosition(Accessor) - Method in class jdsl.core.ref.NodeBinaryTree

Casts the accessor passed in to the appropriate node class for this container; also checks if it is null.

childAtRank(Position, int) - Method in interface jdsl.core.api.InspectableTree

childAtRank(Position, int) - Method in class jdsl.core.ref.NodeBinaryTree

O(1) time

childAtRank(Position, int) - Method in class jdsl.core.ref.NodeTree

O(1) time

children(Position) - Method in interface jdsl.core.api.InspectableTree

Returns an iterator over the children of the node in order.

children(Position) - Method in class jdsl.core.ref.NodeBinaryTree

O(1) time

children(Position) - Method in class jdsl.core.ref.NodeTree

O(1) time if cache exists, O(the number of children of the node) otherwise.

cleanup() - Method in class jdsl.graph.algo.AbstractTopologicalSort

Cleans up all decorations that this algorithm was storing in the provided graph.

cleanup() - Method in class jdsl.graph.algo.DFS

Cleans up all decorations stored in the provided graph.

cleanup() - Method in class jdsl.graph.algo.IntegerDijkstraTemplate

Removes the decorations from the vertices.

closestAfter(Object) - Method in interface jdsl.core.api.InspectableOrderedDictionary

Returns the locator with smallest key greater than or equal to the search key.

closestAfter(Object) - Method in class jdsl.core.ref.RedBlackTree

Takes O(logN) time -- traverses the height of the tree once.

closestBefore(Object) - Method in interface jdsl.core.api.InspectableOrderedDictionary

Returns the locator with largest key less than or equal to the search key.

closestBefore(Object) - Method in class jdsl.core.ref.RedBlackTree

Takes O(logN) time -- traverses the height of the tree once.

colorPromotion(Position, Position) - Method in class jdsl.core.ref.RedBlackTree

Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree Do a color promotion and then check if colors are now wrong higher up Protected for purposes of allowing snapshots during visualization

compare(Object, Object) - Method in interface jdsl.core.api.Comparator

A C-style comparison function that returns a negative value if the first object is less than the second, a positive value if the second object is less, and 0 if the two objects are equal.

compare(Object, Object) - Method in class jdsl.core.ref.AbstractComparator

compare(Object, Object) - Method in class jdsl.core.ref.ComparableComparator

Invokes the compareTo method of x1 on x2.

compare(Object, Object) - Method in class jdsl.core.ref.ComparatorExtender

Adapts the comparator method of the underlying comparator.

compare(Object, Object) - Method in class jdsl.core.ref.ComparatorReverser

compare(Object, Object) - Method in class jdsl.core.ref.IntegerComparator

connectingEdges(Vertex, Vertex) - Method in interface jdsl.graph.api.InspectableGraph

Gives all edges connecting two vertices.

connectingEdges(Vertex, Vertex) - Method in class jdsl.graph.ref.AbstractGraph

Built on incidentEdges(.)

container() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode

O(1) time

container() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode

contains(Accessor) - Method in interface jdsl.core.api.InspectableContainer

Checks whether this container contains accessor a

contains(Accessor) - Method in class jdsl.core.ref.ArrayHeap

time complexity = worst-case O(1)

contains(Accessor) - Method in class jdsl.core.ref.ArraySequence

O(1) time.

contains(Accessor) - Method in class jdsl.core.ref.HashtableDictionary

O(1)

contains(Accessor) - Method in class jdsl.core.ref.NodeBinaryTree

O(1) time

contains(Accessor) - Method in class jdsl.core.ref.NodeSequence

O(1) time

contains(Accessor) - Method in class jdsl.core.ref.NodeTree

O(1) time

contains(Accessor) - Method in class jdsl.core.ref.RedBlackTree

Takes O(1) time

contains(Accessor) - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

contract(Position) - Method in interface jdsl.core.api.Tree

Replaces a node with its children in the appropriate order.

contract(Position) - Method in class jdsl.core.ref.NodeTree

O(1) time

cut(Position) - Method in interface jdsl.core.api.BinaryTree

Position node and all its children are removed from this binary tree and replaced with a new external node with a null element.

cut(Position) - Method in interface jdsl.core.api.Tree

Cuts this tree above the given node, and replaces this position with an external node with a null element.

cut(Position) - Method in class jdsl.core.ref.NodeBinaryTree

Takes O(S) time, where S is the number of positions in the subtree to cut

cut(Position) - Method in class jdsl.core.ref.NodeTree

O(size of the cut subtree) time

cycleStart_ - Variable in class jdsl.graph.algo.DirectedFindCycleDFS

The Vertex which has been encountered twice on one path, proving that a cycle exists.

cycleStart_ - Variable in class jdsl.graph.algo.FindCycleDFS

The Vertex which has been encountered twice on one path, proving that a cycle exists.

D

DFS - class jdsl.graph.algo.DFS.

algorithmic template may be extended to solve a variety of problems on either directed or undirected graphs.

DFS() - Constructor for class jdsl.graph.algo.DFS

DOUBLEBLACK - Static variable in class jdsl.core.ref.RedBlackTree

Decorable - interface jdsl.core.api.Decorable.

Decorability is the ability to attach extra pieces of information to an object.

Dictionary - interface jdsl.core.api.Dictionary.

A container that accepts (key,element) pairs and allows later lookup of the element associated with a particular key.

DirectedDFS - class jdsl.graph.algo.DirectedDFS.

DirectedDFS() - Constructor for class jdsl.graph.algo.DirectedDFS

DirectedFindCycleDFS - class jdsl.graph.algo.DirectedFindCycleDFS.

This class specializes DFS to determine if the connected component of the start vertex contains a cycle and if so return it.

DirectedFindCycleDFS() - Constructor for class jdsl.graph.algo.DirectedFindCycleDFS

Simple constructor initializes instance variables.

defaultInitialCapacity - Static variable in class jdsl.core.ref.ArrayHeap

degree(Vertex) - Method in interface jdsl.graph.api.InspectableGraph

Gives the degree of a vertex, counting both directed and undirected edges.

degree(Vertex, int) - Method in interface jdsl.graph.api.InspectableGraph

Gives the degree of a vertex, counting all edges of the specified type.

degree(Vertex) - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

degree(Vertex, int) - Method in class jdsl.graph.ref.IncidenceListGraph

O(degree)

destination(Vertex, Edge) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate

Can be overridden to supply the destination of an edge, although I can't think of any reason to do so.

destination(Vertex, Edge) - Method in class jdsl.graph.algo.IntegerPrimTemplate

Can be overridden to supply the destination of an edge, although I can't think of any reason to do so.

destination(Edge) - Method in interface jdsl.graph.api.InspectableGraph

destination(Edge) - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

destroy(Object) - Method in interface jdsl.core.api.Decorable

Removes the (attribute, value) entry associated with a certain attribute, attr, from the decorable object.

destroy(Object) - Method in class jdsl.core.ref.HashtableDecorable

Destroys a decoration.

destroy(Object) - Method in class jdsl.graph.api.Edge.NONEEdge

destroy(Object) - Method in class jdsl.graph.api.Vertex.NONEVertex

dfsVisit(Vertex) - Method in class jdsl.graph.algo.DFS

Performs a recursive depth-first search starting at v

dictionaryToMap(InspectableDictionary, Map) - Static method in class jdsl.core.util.Converter

Places the contents of a dictionary into a map.

dictionaryToSortedMap(InspectableDictionary, SortedMap) - Static method in class jdsl.core.util.Converter

Places the contents of a dictionary into a sorted map.

directedEdges() - Method in interface jdsl.graph.api.InspectableGraph

directedEdges() - Method in class jdsl.graph.ref.AbstractGraph

Built on edges() and isDirected(.)

distance(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate

Returns the distance of a vertex from the source.

doOneIteration() - Method in class jdsl.graph.algo.IntegerDijkstraTemplate

Can be called manually to single-step the algorithm, but you must call init(.) before the first call to this method.

doOneIteration() - Method in class jdsl.graph.algo.IntegerPrimTemplate

Can be called manually to single-step the algorithm, but you must call init(.) before the first call to this method.

done_ - Variable in class jdsl.graph.algo.DirectedFindCycleDFS

This is set to true if a cycle is found, alerting the DFS to finish early

done_ - Variable in class jdsl.graph.algo.FindCycleDFS

This is set to true if a cycle is found, alerting the DFS to finish early

E

EDGE_TYPE - Static variable in class jdsl.graph.algo.DFS

Constant used as key to look up an edge's type.

Edge - interface jdsl.graph.api.Edge.

Empty, typing interface for Positions that are edges.

Edge.NONEEdge - class jdsl.graph.api.Edge.NONEEdge.

A dummy class, used to implement the constant Edge.NONE
.

EdgeDirection - interface jdsl.graph.api.EdgeDirection.

Interface containing constants for specifying which edges are desired in graph-query methods.

EdgeIterator - interface jdsl.graph.api.EdgeIterator.

Iterator over a set of edges.

EdgeIteratorAdapter - class jdsl.graph.ref.EdgeIteratorAdapter.

Takes an ObjectIterator known to be iterating over things that are edges, and makes it appear as an EdgeIterator.

EdgeIteratorAdapter(ObjectIterator) - Constructor for class jdsl.graph.ref.EdgeIteratorAdapter

EmptyContainerException - exception jdsl.core.api.EmptyContainerException.

An EmptyContainerException indicates that the Container can't fulfill the requested operation because it is empty.

EmptyContainerException(String) - Constructor for class jdsl.core.api.EmptyContainerException

EmptyContainerException(String, Throwable) - Constructor for class jdsl.core.api.EmptyContainerException

EmptyContainerException(Throwable) - Constructor for class jdsl.core.api.EmptyContainerException

EqualityComparator - interface jdsl.core.api.EqualityComparator.

This interface defines an equality comparison on a set of objects.

EulerTour - class jdsl.core.algo.traversals.EulerTour.

The EulerTour algorithm is a tree traversal that can be informally described as a walk around tree T, where we start by going from the root towards its left child, viewing the edges of T as being "walls" that we always keep to our left.

EulerTour() - Constructor for class jdsl.core.algo.traversals.EulerTour

The constructor for the algorithm.

edge() - Method in interface jdsl.graph.api.EdgeIterator

edge() - Method in class jdsl.graph.ref.EdgeIteratorAdapter

edgeRelaxed(Vertex, int, Edge, int, Vertex, int) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate

Can be overridden in any application where the edges considered for the shortest-path tree matter.

edge_in_rt_style - Static variable in class jdsl.graph.ref.ToString

edges() - Method in interface jdsl.graph.api.InspectableGraph

edges() - Method in class jdsl.graph.ref.IncidenceListGraph

O(E)

element() - Method in interface jdsl.core.api.Accessor

Gets the element currently associated with this accessor.

element() - Method in class jdsl.core.api.InspectableDictionary.InvalidLocator

element() - Method in interface jdsl.core.api.LocatorIterator

Shortcut for locator().element().

element() - Method in interface jdsl.core.api.PositionIterator

Shortcut for position().element().

element() - Method in class jdsl.core.ref.AbstractArrayIterator

element() - Method in class jdsl.core.ref.InOrderIterator

Takes O(1) time

element() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode

O(1) time

element() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode

Should never be called

element() - Method in class jdsl.core.ref.NodeSequence.FNSNode

element() - Method in class jdsl.core.ref.PostOrderIterator

Takes O(1) time

element() - Method in class jdsl.core.ref.PreOrderIterator

Takes O(1) time

element() - Method in class jdsl.graph.api.Edge.NONEEdge

element() - Method in class jdsl.graph.api.Vertex.NONEVertex

element() - Method in class jdsl.graph.ref.EdgeIteratorAdapter

element() - Method in class jdsl.graph.ref.VertexIteratorAdapter

elements() - Method in interface jdsl.core.api.InspectableContainer

Returns an iterator over all the elements stored in this container.

elements() - Method in class jdsl.core.ref.ArrayHeap

Cached for constant factor efficiency.

elements() - Method in class jdsl.core.ref.ArraySequence

O(1) time if the cache already exists.

elements() - Method in class jdsl.core.ref.HashtableDictionary

O(1) if structure *AND* elements haven't changed, O(N) otherwise.

elements() - Method in class jdsl.core.ref.NodeBinaryTree

Takes O(N) time from the need to iterate through the tree during snapshot, where N is the number of elements in the tree

elements() - Method in class jdsl.core.ref.NodeSequence

O(1) time if the cache already exists Otherwise O(N) to construct it

elements() - Method in class jdsl.core.ref.NodeTree

O(1) time if cache already exists, O(size of the tree) otherwise

elements() - Method in class jdsl.core.ref.RedBlackTree

Takes O(N) time from the need to iterate through the tree during snapshot -- where N= the number of locators in the tree Could very easily be cached; not sure that would be useful

elements() - Method in class jdsl.graph.ref.IncidenceListGraph

O(V+E)

endVertices(Edge) - Method in interface jdsl.graph.api.InspectableGraph

endVertices(Edge) - Method in class jdsl.graph.ref.IncidenceListGraph

O(1)

execute(InspectableTree) - Method in class jdsl.core.algo.traversals.EulerTour

This method should be called after construction.

execute(InspectableGraph) - Method in class jdsl.graph.algo.AbstractTopologicalSort

The client calls this method to execute the algorithm.

execute(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.DFS

Runs the depth first search algorithm on a graph.

execute(InspectableGraph) - Method in class jdsl.graph.algo.DFS

Execute a DFS without specifying an initial source vertex.

execute(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.DirectedFindCycleDFS

execute(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.FindCycleDFS

execute(InspectableGraph, Vertex, Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraPathfinder

execute(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate

The easiest way to use the algorithm is to use this method.

executeAll(InspectableGraph, Vertex, int) - Method in class jdsl.graph.algo.IntegerPrimTemplate

The easiest way to use the algorithm is to use this method.

executeAll(InspectableGraph, Vertex) - Method in class jdsl.graph.algo.IntegerPrimTemplate

Just like the other version of executeAll(.), but with infinity=Integer.MAX_VALUE

expand(Position, Position, Object) - Method in interface jdsl.core.api.Tree

Replaces a set of consecutive children with a new node having those children as its children in the appropriate order.

expand() - Method in class jdsl.core.ref.NodeBinaryTree.NBTNode

O(1) time Expands this node into an internal node Asserts if this node is external

expand() - Method in class jdsl.core.ref.NodeBinaryTree.NBTSuperNode

Should never be called

expand(Position, Position, Object) - Method in class jdsl.core.ref.NodeTree

O(number of children of a new node) time

expandExternal(Position) - Method in interface jdsl.core.api.BinaryTree

The external position specified is transformed into an internal, and it gains two external children.

expandExternal(Position) - Method in class jdsl.core.ref.NodeBinaryTree

O(1) time

F

FINISH_TIME - Static variable in class jdsl.graph.algo.DFS

Constant used as key to look up the finish time of a vertex.

FORWARD_EDGE - Static variable in class jdsl.graph.algo.DFS

Constant signifying that a marked edge is a forward edge.

FindCycleDFS - class jdsl.graph.algo.FindCycleDFS.

This class specializes DFS to determine if the connected component of the start vertex contains a cycle and if so return it.

FindCycleDFS() - Constructor for class jdsl.graph.algo.FindCycleDFS

Simple constructor initializes instance variables.

FullContainerException - exception jdsl.core.ref.FullContainerException.

A FullContainerException indicates that the Container can't fulfill the requested operation because it is full.

FullContainerException(String) - Constructor for class jdsl.core.ref.FullContainerException

FullContainerException(String, Throwable) - Constructor for class jdsl.core.ref.FullContainerException

FullContainerException(Throwable) - Constructor for class jdsl.core.ref.FullContainerException

find(Object) - Method in interface jdsl.core.api.InspectableDictionary

Finds an object that is mapped to a particular key.

find(Object) - Method in class jdsl.core.ref.HashtableDictionary

O(1) -- expected, O(N) worst case with excessive chaining.

find(Object) - Method in class jdsl.core.ref.RedBlackTree

Takes O(logN) time -- where N = the number of locators in the tree and O(logN) = the height of the tree Takes the time to traverse the tree's height, which is O(logN)

findAll(Object) - Method in interface jdsl.core.api.InspectableDictionary

Finds all elements mapped to a particular key.

findAll(Object) - Method in class jdsl.core.ref.HashtableDictionary

O(#elts with target key), worst case O(N)

findAll(Object) - Method in class jdsl.core.ref.RedBlackTree

Takes O(logN+R) time -- where N = the number of locators in the tree and O(logN) = the height of the tree, and R = the number of instances of key in the tree O(log N) for one element; in theory, for each element, taking its inorder prev or next may take up to O(log N).

finishTime(Vertex) - Method in class jdsl.graph.algo.DFS

Returns the "Finish time" of a Vertex.

finishVisit(Vertex) - Method in class jdsl.graph.algo.DFS

Called when the search has finished with the vertex.

finishVisit(Vertex) - Method in class jdsl.graph.algo.DirectedFindCycleDFS

Once the visit has ended, they are removed from the prospective cyclic path.

finishVisit(Vertex) - Method in class jdsl.graph.algo.FindCycleDFS

Once the visit has ended, they are removed from the prospective cyclic path.

first() - Method in interface jdsl.core.api.InspectableOrderedDictionary

Returns the Locator that is sequentially before any other Locator in this Container.

first() - Method in interface jdsl.core.api.InspectableSequence

The first position of the sequence.

first() - Method in class jdsl.core.ref.ArraySequence

O(1) time.

first() - Method in class jdsl.core.ref.NodeSequence

O(1) time

first() - Method in class jdsl.core.ref.PostOrderIterator

Takes O(1) time Sets the current node to the first node.

first() - Method in class jdsl.core.ref.RedBlackTree

Takes O(log N) time to traverse the height of the tree where N is the number of locators in the tree and O(logN) is the height of the tree

firstChild(Position) - Method in interface jdsl.core.api.InspectableTree

firstChild(Position) - Method in class jdsl.core.ref.NodeBinaryTree

O(1) time

firstChild(Position) - Method in class jdsl.core.ref.NodeTree

O(1) time

G

G - Variable in class jdsl.graph.algo.IntegerPrimTemplate

Graph - interface jdsl.graph.api.Graph.

An interface describing a combinatorial graph.

GraphException - exception jdsl.graph.api.GraphException.

jdsl.graph.api package.

GraphException(String) - Constructor for class jdsl.graph.api.GraphException

GraphException(String, Throwable) - Constructor for class jdsl.graph.api.GraphException

GraphException(Throwable) - Constructor for class jdsl.graph.api.GraphException

g_ - Variable in class jdsl.graph.algo.IntegerDijkstraTemplate

get(Object) - Method in interface jdsl.core.api.Decorable

Returns the value in the (attribute, value) entry associated with a certain attribute, attr, in this decorable object.

get(Object) - Method in class jdsl.core.ref.HashtableDecorable

Gets the value of a decoration.

get(Object) - Method in class jdsl.graph.api.Edge.NONEEdge

get(Object) - Method in class jdsl.graph.api.Vertex.NONEVertex

getCycle() - Method in class jdsl.graph.algo.DirectedFindCycleDFS

Returns an ObjectIterator containing all of the Vertices in the found cycle.

getCycle() - Method in class jdsl.graph.algo.FindCycleDFS

Returns an ObjectIterator containing all of the Vertices in the found cycle.

getEdgeToParent(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate

Can be overridden to supply a way of storing and retrieving one edge per vertex.

getLocator(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate

Can be overridden to supply a way of storing and retrieving one locator per vertex.

getLocator(Vertex) - Method in class jdsl.graph.algo.IntegerPrimTemplate

Can be overridden to supply a way of storing and retrieving one locator per vertex.

graftOnLeft(Position, Object, BinaryTree) - Method in interface jdsl.core.api.BinaryTree

Position subtreeRoot of this binary tree is demoted one level, with all the positions and elements unchanged, and becomes the right child of a new node storing the given element.

graftOnLeft(Position, Object, BinaryTree) - Method in class jdsl.core.ref.NodeBinaryTree

Takes O(S) time, where S is the number of positions in the new subtree to graft on You are only allowed to link in and replaceSubtree with other instances of NodeBinaryTree (or subclasses thereof)

graftOnRight(Position, Object, BinaryTree) - Method in interface jdsl.core.api.BinaryTree

Position subtreeRoot of this binary tree is demoted one level, with all the positions and elements unchanged, and becomes the left child of a new node, storing the given element.

graftOnRight(Position, Object, BinaryTree) - Method in class jdsl.core.ref.NodeBinaryTree

Takes O(S) time, where S is the number of positions in the new subtree to graft on You are only allowed to link in and replaceSubtree with other instances of NodeBinaryTree (or subclasses thereof)

graph_ - Variable in class jdsl.graph.algo.AbstractTopologicalSort

The Graph that the algorithm executes upon.

graph_ - Variable in class jdsl.graph.algo.DFS

The graph being traversed.

H

HashComparator - interface jdsl.core.api.HashComparator.

This interface provides a way of mapping any object in a set to an integer, for purposes of implementing hash tables.

HashtableDecorable - class jdsl.core.ref.HashtableDecorable.

An implementation of Decorable using a hashtable.

HashtableDecorable() - Constructor for class jdsl.core.ref.HashtableDecorable

HashtableDictionary - class jdsl.core.ref.HashtableDictionary.

An implementation of Dictionary using a chaining hashtable.

HashtableDictionary(HashComparator) - Constructor for class jdsl.core.ref.HashtableDictionary

This constructor takes a Comparator which can determine if it can compare a key, and if two keys are equal, nothing more.

HashtableDictionary(HashComparator, int) - Constructor for class jdsl.core.ref.HashtableDictionary

This constructor takes a Comparator which can determine if it can compare a key, and if two keys are equal, nothing more, and an integer denoting the initial capacity.

HeapSort - class jdsl.core.algo.sorts.HeapSort.

Performs a heap-sort in O(n log n) time, provided only that the replaceElement(.) method of the Sequence works in O(1) time (and thus the style of implementation of the Sequence is not relevant).

HeapSort() - Constructor for class jdsl.core.algo.sorts.HeapSort

has(Object) - Method in interface jdsl.core.api.Decorable

Tests whether there is an (attribute, value) entry associated with a certain attribute in this decorable object.

has(Object) - Method in class jdsl.core.ref.HashtableDecorable

Tests if a decoration exists.

has(Object) - Method in class jdsl.graph.api.Edge.NONEEdge

has(Object) - Method in class jdsl.graph.api.Vertex.NONEVertex

hasNext() - Method in interface jdsl.core.api.ObjectIterator

hasNext() - Method in class jdsl.core.ref.AbstractArrayIterator

hasNext() - Method in class jdsl.core.ref.ArrayObjectIterator

Takes O(1) time

hasNext() - Method in class jdsl.core.ref.InOrderIterator

Takes O(1) time

hasNext() - Method in class jdsl.core.ref.PostOrderIterator

Takes O(1) time

hasNext() - Method in class jdsl.core.ref.PreOrderIterator

Takes O(1) time

hasNext() - Method in class jdsl.graph.ref.AbstractGraph.OO_to_O_MergerIterator

hasNext() - Method in class jdsl.graph.ref.EdgeIteratorAdapter

hasNext() - Method in class jdsl.graph.ref.VertexIteratorAdapter

hash(Object) - Method in class jdsl.core.ref.HashtableDecorable

Gets the hashcode for a particular object.

hashValue(Object) - Method in interface jdsl.core.api.HashComparator

Returns the hash code value to be used for the object in this comparator.

hashValue(Object) - Method in class jdsl.core.ref.IntegerHashComparator

defines a mapping f: Integer -> \mathbb{Z} \cap [0, 2^{31} -1]

hashValue(Object) - Method in class jdsl.core.ref.ObjectHashComparator

I

IN - Static variable in interface jdsl.graph.api.EdgeDirection

INFINITY - Variable in class jdsl.graph.algo.IntegerPrimTemplate

InOrderIterator - class jdsl.core.ref.InOrderIterator.

The inorder iterator gives an inorder iteration of a binary tree.

InOrderIterator(InspectableBinaryTree) - Constructor for class jdsl.core.ref.InOrderIterator

Constructs a new InOrderIterator to iterate over the given container Puts a reference to each position into the array -- takes O(N) time where N = the number of positions in the container (given assumptions discussed in header)

IncidenceListGraph - class jdsl.graph.ref.IncidenceListGraph.

An implementation of the Graph interface, including self-loops, parallel edges, and mixed directed and undirected edges.

IncidenceListGraph() - Constructor for class jdsl.graph.ref.IncidenceListGraph

Creates a new IncidenceListGraph with default parameters.

InspectableBinaryTree - interface jdsl.core.api.InspectableBinaryTree.

Please refer to the documentation of the BinaryTree interface.

InspectableContainer - interface jdsl.core.api.InspectableContainer.

A "read only" interface to a container; please see Container for more details.

InspectableDictionary - interface jdsl.core.api.InspectableDictionary.

A read-only lookup structure; please refer to the documentation of Dictionary for more details.

InspectableDictionary.InvalidLocator - class jdsl.core.api.InspectableDictionary.InvalidLocator.

A locator that is always invalid.

InspectableDictionary.InvalidLocator(String) - Constructor for class jdsl.core.api.InspectableDictionary.InvalidLocator

InspectableDictionary.InvalidLocator() - Constructor for class jdsl.core.api.InspectableDictionary.InvalidLocator

InspectableGraph - interface jdsl.graph.api.InspectableGraph.

An interface describing the accessor methods of a combinatorial graph.

InspectableKeyBasedContainer - interface jdsl.core.api.InspectableKeyBasedContainer.

Please refer to the documentation of KeyBasedContainer.

InspectableOrderedDictionary - interface jdsl.core.api.InspectableOrderedDictionary.

A read-only lookup structure in which an ordering of the keys is maintained; please refer to the documentation of OrderedDictionary for more details.

InspectablePositionalContainer - interface jdsl.core.api.InspectablePositionalContainer.

Please refer to the documentation of PositionalContainer.

InspectableSequence - interface jdsl.core.api.InspectableSequence.

Please refer to the documentation of Sequence.

InspectableTree - interface jdsl.core.api.InspectableTree.

Please refer to the documentation of Tree

IntegerComparator - class jdsl.core.ref.IntegerComparator.

Compares java.lang.Integers.

IntegerComparator() - Constructor for class jdsl.core.ref.IntegerComparator

IntegerDijkstraPathfinder - class jdsl.graph.algo.IntegerDijkstraPathfinder.

using Dijkstra's algorithm.

IntegerDijkstraPathfinder() - Constructor for class jdsl.graph.algo.IntegerDijkstraPathfinder

IntegerDijkstraTemplate - class jdsl.graph.algo.IntegerDijkstraTemplate.

Implementation of Dijkstra's algorithm using the template-method pattern: the core functionality is coded in a few final methods that call overridable methods to do some of the work.

IntegerDijkstraTemplate() - Constructor for class jdsl.graph.algo.IntegerDijkstraTemplate

IntegerHashComparator - class jdsl.core.ref.IntegerHashComparator.

An implementation of a HashComparator for java.lang.Integers

IntegerHashComparator() - Constructor for class jdsl.core.ref.IntegerHashComparator

IntegerPrimTemplate - class jdsl.graph.algo.IntegerPrimTemplate.

Implementation of the algorithm of Prim and Jarnik for finding a minimum spanning tree, using the template-method pattern: the core functionality is coded in a few final methods that call overridable methods to do some of the work.

IntegerPrimTemplate() - Constructor for class jdsl.graph.algo.IntegerPrimTemplate

InvalidAccessorException - exception jdsl.core.api.InvalidAccessorException.

Used when an accessor (position or locator) is invalid, either internally invalid or invalid with respect to a particular container.

InvalidAccessorException(String) - Constructor for class jdsl.core.api.InvalidAccessorException

InvalidAccessorException(String, Throwable) - Constructor for class jdsl.core.api.InvalidAccessorException

InvalidAccessorException(Throwable) - Constructor for class jdsl.core.api.InvalidAccessorException

InvalidAttributeException - exception jdsl.core.api.InvalidAttributeException.

Used when the key for an attribute lookup is not supported by the implementation's lookup mechanism.

InvalidAttributeException(String) - Constructor for class jdsl.core.api.InvalidAttributeException

InvalidAttributeException(String, Throwable) - Constructor for class jdsl.core.api.InvalidAttributeException

InvalidAttributeException(Throwable) - Constructor for class jdsl.core.api.InvalidAttributeException

InvalidContainerException - exception jdsl.core.api.InvalidContainerException.

Used to indicate that a container passed to a function is of the wrong type or otherwise invalid for that function call.

InvalidContainerException(String) - Constructor for class jdsl.core.api.InvalidContainerException

InvalidContainerException(String, Throwable) - Constructor for class jdsl.core.api.InvalidContainerException

InvalidContainerException(Throwable) - Constructor for class jdsl.core.api.InvalidContainerException

InvalidEdgeException - exception jdsl.graph.api.InvalidEdgeException.

An object of this class gets thrown when topological information related to Edges is somehow incorrect.

InvalidEdgeException(String) - Constructor for class jdsl.graph.api.InvalidEdgeException

InvalidEdgeException(String, Throwable) - Constructor for class jdsl.graph.api.InvalidEdgeException

InvalidEdgeException(Throwable) - Constructor for class jdsl.graph.api.InvalidEdgeException

InvalidKeyException - exception jdsl.core.api.InvalidKeyException.

Used when a key passed to a key-based container is not supported by the implementation's lookup mechanism.

InvalidKeyException(String) - Constructor for class jdsl.core.api.InvalidKeyException

InvalidKeyException(String, Throwable) - Constructor for class jdsl.core.api.InvalidKeyException

InvalidKeyException(Throwable) - Constructor for class jdsl.core.api.InvalidKeyException

InvalidMethodCallException - exception jdsl.core.api.InvalidMethodCallException.

InvalidMethodCallException is intended for use only in methods that you expect never to be called -- for instance, in the prev() method of the head node in a sequence.

InvalidMethodCallException(String) - Constructor for class jdsl.core.api.InvalidMethodCallException

InvalidMethodCallException(String, Throwable) - Constructor for class jdsl.core.api.InvalidMethodCallException

InvalidMethodCallException(Throwable) - Constructor for class jdsl.core.api.InvalidMethodCallException

InvalidQueryException - exception jdsl.graph.algo.InvalidQueryException.

This exception is currently used only by the two subclasses of AbstractTopologicalSort.

InvalidQueryException(String) - Constructor for class jdsl.graph.algo.InvalidQueryException

InvalidQueryException(String, Throwable) - Constructor for class jdsl.graph.algo.InvalidQueryException

InvalidQueryException(Throwable) - Constructor for class jdsl.graph.algo.InvalidQueryException

InvalidVertexException - exception jdsl.graph.api.InvalidVertexException.

An object of this class gets thrown when topological information related to vertices is incorrect.

InvalidVertexException(String) - Constructor for class jdsl.graph.api.InvalidVertexException

InvalidVertexException(String, Throwable) - Constructor for class jdsl.graph.api.InvalidVertexException

InvalidVertexException(Throwable) - Constructor for class jdsl.graph.api.InvalidVertexException

iCurrentIndex_ - Variable in class jdsl.core.ref.AbstractArrayIterator

iCurrentIndex_ - Variable in class jdsl.core.ref.ArrayObjectIterator

iLastIndex_ - Variable in class jdsl.core.ref.AbstractArrayIterator

iLastIndex_ - Variable in class jdsl.core.ref.ArrayObjectIterator

incidentEdges(Vertex) - Method in class jdsl.graph.algo.IntegerDijkstraTemplate

Can be overridden in any application where the default choice of edges to consider at any vertex is not satisfactory.

incidentEdges(Vertex) - Method in class jdsl.graph.algo.IntegerPrimTemplate

Can be overridden in any application where the default choice of edges to consider at any vertex is not satisfactory.

incidentEdges(Vertex) - Method in interface jdsl.graph.api.InspectableGraph

incidentEdges(Vertex, int) - Method in interface jdsl.graph.api.InspectableGraph

incidentEdges(Vertex) - Method in class jdsl.graph.ref.IncidenceListGraph

O(degree)

incidentEdges(Vertex, int) - Method in class jdsl.graph.ref.IncidenceListGraph

O(degree)

init() - Method in class jdsl.core.algo.traversals.EulerTour

Called in execute(.), before algorithm is executed.

init(InspectableGraph) - Method in class jdsl.graph.algo.AbstractTopologicalSort

This helper method is called by the execute(.) method.