Algorithm
Development Kit 1.0
A B C D E F G H I K L M N O P Q R S T U V W X Y _

A

above - Variable in class algs.model.kdtree.DimensionalNode
Node above this one.
AbstractBinaryTraversal<T extends IBinaryTreeNode> - Class in algs.model.tree
The default traversal class for IBinaryTree trees.
AbstractBinaryTraversal(T) - Constructor for class algs.model.tree.AbstractBinaryTraversal
Start the traversal at the given node.
AbstractBinaryTraversal.Phase - Enum in algs.model.tree
Binary traversals have three phases.
accept(IBalancedVisitor<K, V>) - Method in class algs.model.tree.BalancedTree
Accept a visitor for a inorder traversal.
accept(IVisitor) - Method in class algs.model.tree.RightThreadedBinaryTree
Accept a visitor for a inorder traversal.
add(IInterval) - Method in class algs.model.interval.SegmentTree
Add the given interval to the tree.
add(A, B) - Method in class algs.model.network.DisjointPairs
Add a pairing (a,b) to the set.
add(IPoint) - Method in class algs.model.problems.convexhull.andrew.PartialLinkedListHull
Add point to the Partial Hull.
add(IPoint) - Method in class algs.model.problems.convexhull.PartialHull
Add point to the Partial Hull.
add(K, V) - Method in class algs.model.search.AssociativeHashTable
 
add(K, V) - Method in interface algs.model.search.IHashtableAccess
Associate element v with key k.
add(V) - Method in class algs.model.search.ListHashTable
ListHashTable objects add elements who are themselves keys.
add(V, V) - Method in class algs.model.search.ListHashTable
 
addBackward(EdgeInfo) - Method in class algs.model.network.VertexStructure
Add the given edge into the list of backward edges.
addForward(EdgeInfo) - Method in class algs.model.network.VertexStructure
Add the given edge into the list of forward edges.
addIntersectingLineSegment(ILineSegment) - Method in class algs.model.problems.segmentIntersection.EventPoint
Add this line segment as an intersecting one.
addLowerLineSegment(ILineSegment) - Method in class algs.model.problems.segmentIntersection.EventPoint
Add this line segment but only if its Lower (i.e., End) is reflective of this eventPoint.
addTrial(long, long, long) - Method in class algs.model.tests.common.TrialSuite
Record the timing of a trial of size n that started at startTime and completed at endTime.
addUpperLineSegment(ILineSegment) - Method in class algs.model.problems.segmentIntersection.EventPoint
Add this line segment but only if its Upper (i.e., Start) is reflective of this eventPoint.
addUpperLineSegments(List<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.EventPoint
Batch process a set of upper insertions here.
advance() - Method in class algs.model.tree.AbstractBinaryTraversal
Advance the traversal, returning the SELF node once found or null when all is done.
advancePhase(AbstractBinaryTraversal.Phase) - Method in class algs.model.tree.AbstractBinaryTraversal
Determine the next phase in the traversal.
advancePhase(AbstractBinaryTraversal.Phase) - Method in class algs.model.tree.InorderTraversal
Advance phase to follow inorder traversal.
advancePhase(AbstractBinaryTraversal.Phase) - Method in class algs.model.tree.PostorderTraversal
Advance phase to follow postorder traversal.
advancePhase(AbstractBinaryTraversal.Phase) - Method in class algs.model.tree.PreorderTraversal
Advance phase to follow preorder traversal.
AklToussaint - Class in algs.model.problems.convexhull
Heuristic that offers noticeable speed-up when when applied to Convex Hull problems.
algs.debug - package algs.debug
Defines core abstractions for generating visualizations to track the progress of an algorithm.
algs.debug.drawers - package algs.debug.drawers
Defines core drawing classes for the DOTTY output.
algs.model - package algs.model
Defines a set of interfaces for core entities used by various algorithms.
algs.model.array - package algs.model.array
Defines commonly shared functionality for computations over arrays.
algs.model.data - package algs.model.data
Defines commonly functionality for generating random samples of data
algs.model.data.circles - package algs.model.data.circles
Generator for creating random circles.
algs.model.data.nd - package algs.model.data.nd
Generators that construct n dimensional data sets.
algs.model.data.points - package algs.model.data.points
Generators for creating random points according to a variety of distributions.
algs.model.data.segments - package algs.model.data.segments
Generators for creating random line segments according to a variety of distributions.
algs.model.gametree - package algs.model.gametree
Core set of classes and interfaces to support Game Trees.
algs.model.gametree.debug - package algs.model.gametree.debug
Core set of classes for visualizing the progress of a game tree search algorithm.
algs.model.heap - package algs.model.heap
Core set of classes to implement Binary Heaps.
algs.model.interval - package algs.model.interval
Defines the Segment Tree, a data structure for maintaining sets of Intervals within a closed integer domain.
algs.model.kdtree - package algs.model.kdtree
Defines the K-dimensional Tree and the optimized TwoDTree variation.
algs.model.list - package algs.model.list
Defines commonly shared functionality for maintaining linked lists.
algs.model.nd - package algs.model.nd
Defines classes to represent n-dimensional points and n-dimensional regions called hypercubes.
algs.model.network - package algs.model.network
Defines classes to represent Flow Network algorithms.
algs.model.network.debug - package algs.model.network.debug
Defines classes for producing visualization of Flow Network problems.
algs.model.network.matching - package algs.model.network.matching
Defines classes to show how to convert a Matching problem into a Flow Network problem.
algs.model.problems - package algs.model.problems
Defines a set of benchmark problems exercising the algs.model package.
algs.model.problems.convexhull - package algs.model.problems.convexhull
Defines core classes for the Convex Hull problem.
algs.model.problems.convexhull.andrew - package algs.model.problems.convexhull.andrew
Defines solution to the Convex Hull problem proposed by Andrew, which is a ConvexHullScan.
algs.model.problems.convexhull.balanced - package algs.model.problems.convexhull.balanced
Defines solution to the Convex Hull problem proposed by Andrew which uses balanced binary trees to store the partial hulls, rather than linked lists.
algs.model.problems.convexhull.bucket - package algs.model.problems.convexhull.bucket
Defines solution to the Convex Hull problem which uses BucketSort to sort the points prior to invoking Andrew's algorithm.
algs.model.problems.convexhull.heap - package algs.model.problems.convexhull.heap
Defines solution to the Convex Hull problem proposed by Andrew which uses HeapSort to sort the initial data set rather than QuickSort.
algs.model.problems.convexhull.slowhull - package algs.model.problems.convexhull.slowhull
Defines solution to the Convex Hull problem that relies on a Brute Force n^4 algorithm to check each potential triangle and removes points that fall within the triangle.
algs.model.problems.eightpuzzle - package algs.model.problems.eightpuzzle
Defines the Game Tree example implementing the EightPuzzle, the canonical example used throughout the Path Finding chapter to show how A*star search works.
algs.model.problems.fifteenpuzzle - package algs.model.problems.fifteenpuzzle
Defines the Game Tree example implementing the FifteenPuzzle.
algs.model.problems.nearestNeighbor - package algs.model.problems.nearestNeighbor
Defines the Brute Force Nearest Neighbor implementation to be used as a benchmark when comparing the kd-tree implementation.
algs.model.problems.rangeQuery - package algs.model.problems.rangeQuery
Defines the Brute Force Range Query implementation to be used as a benchmark when comparing the kd-tree implementation.
algs.model.problems.segmentIntersection - package algs.model.problems.segmentIntersection
Defines the classes needed to implement the LineSweep algorithm.
algs.model.problems.segmentIntersection.linkedlist - package algs.model.problems.segmentIntersection.linkedlist
Defines the classes needed to implement the LineSweep algorithm using double-linked lists to store the LineState.
algs.model.problems.segmentIntersection.priorityqueue - package algs.model.problems.segmentIntersection.priorityqueue
Defines the classes needed to implement the event queue using a priority queue that does not support searching.
algs.model.problems.tictactoe.debug - package algs.model.problems.tictactoe.debug
Defines the classes needed to properly generate debugging images for the searches performed over TicTacToe boards.
algs.model.problems.tictactoe.model - package algs.model.problems.tictactoe.model
Entities required to properly play a variety of TicTacToe games.
algs.model.search - package algs.model.search
Defines classes to support a variety of Search algorithms.
algs.model.searchtree - package algs.model.searchtree
Core set of classes to support Search Trees.
algs.model.searchtree.debug - package algs.model.searchtree.debug
Defines classes to support the debugging of search tree algorithms.
algs.model.searchtree.states - package algs.model.searchtree.states
Defines classes that implement the INodeSet interface in different ways.
algs.model.tests.common - package algs.model.tests.common
Provides classes to properly assess the performance of the algorithms.
algs.model.tree - package algs.model.tree
Provides implementations of binary trees and right-threaded binary trees.
algs.model.tree.debug - package algs.model.tree.debug
Defines classes to properly debug the structure of binary trees and balanced binary trees.
algs.model.twod - package algs.model.twod
Provides core implementations of the most common two-dimensional abstractions, such as points, lines and rectangles.
allowDuplicates - Variable in class algs.model.tree.BalancedTree
Allow duplicates?
allowDuplicates() - Method in class algs.model.tree.BalancedTree
Return whether tree allows entries with duplicate keys.
AlphaBeta - Static variable in class algs.model.problems.tictactoe.model.PlayerFactory
 
AlphaBetaDebugNode - Class in algs.model.gametree.debug
This node is used when depicting debugging information about an Alpha/Beta node in the game tree path finding search.
AlphaBetaDebugNode(int, int) - Constructor for class algs.model.gametree.debug.AlphaBetaDebugNode
Represent a node in the search for a solution in alpha beta.
AlphaBetaEvaluation - Class in algs.model.gametree
Initiate AlphaBeta Evaluation over the given game state and ply.
AlphaBetaEvaluation(int) - Constructor for class algs.model.gametree.AlphaBetaEvaluation
Create an evaluator with the given state.
AlphaBetaEvaluation - Class in algs.model.gametree.debug
Initiate AlphaBeta Evaluation over the given game state and ply.
AlphaBetaEvaluation(int) - Constructor for class algs.model.gametree.debug.AlphaBetaEvaluation
Create an evaluator with the given state.
AlphaPrune - Class in algs.model.gametree.debug
This node is used when depicting debugging information when the AlphaBeta search algorithm prunes the search via an AlphaPrune.
AlphaPrune() - Constructor for class algs.model.gametree.debug.AlphaPrune
 
append(E) - Method in class algs.model.list.List
Append element to the end of the list.
areLastThreeNonRight() - Method in class algs.model.problems.convexhull.andrew.PartialLinkedListHull
Determines if last three points reflect a right turn.
areLastThreeNonRight() - Method in class algs.model.problems.convexhull.PartialHull
Determines if last three points reflect a right turn.
Assignment - Class in algs.model.network
Given a bipartite graph of provider nodes P, requirer nodes R, and edge costs c(i,j) for assigning a provider pi to a requirer ri.
Assignment(int[][]) - Constructor for class algs.model.network.Assignment
 
assignVertices(FlowNetwork<?>) - Method in class algs.model.network.debug.CreateImage
Assign node entities for all nodes in the graph according to their unique indices.
AssociativeHashTable<K,V> - Class in algs.model.search
HashTable that uses list collision to store objects whose keys collide.
AssociativeHashTable(int, IHash<K>) - Constructor for class algs.model.search.AssociativeHashTable
Construct initial Hash Table using desired hash method.
AssociativeHashTable(int) - Constructor for class algs.model.search.AssociativeHashTable
Construct initial Hash Table using default hash method that relies on a properly formed hashCode() implementation.
AStarSearch - Class in algs.model.searchtree
Given an initial state and a target goal state, expand successors, always choosing to expand the node in the OPEN list whose evaluation is the smallest.
AStarSearch(IScore) - Constructor for class algs.model.searchtree.AStarSearch
Prepare an A* search using the given scoring function.
AStarSearch - Class in algs.model.searchtree.debug
Given an initial state and a target goal state, expand successors, always choosing to expand the node in the OPEN list whose evaluation is the smallest.
AStarSearch(IScore) - Constructor for class algs.model.searchtree.debug.AStarSearch
Prepare an A* search using the given scoring function.
AugmentedBalancedTree<K> - Class in algs.model.problems.segmentIntersection
The Balanced Binary Tree for this algorithm required internal nodes to store (min, max) links to the leaf nodes, where actual segments are to be stored.
AugmentedBalancedTree() - Constructor for class algs.model.problems.segmentIntersection.AugmentedBalancedTree
Constructs an empty Balanced Tree.
AugmentedBalancedTree(Comparator<? super K>) - Constructor for class algs.model.problems.segmentIntersection.AugmentedBalancedTree
Constructs a new, empty tree sorted according to the given comparator.
AugmentedNode<K> - Class in algs.model.problems.segmentIntersection
The line sweep intersection algorithm stores information with internal nodes, and the leaf nodes contain the actual segments.
AugmentedNode(K, K, AugmentedNode<K>) - Constructor for class algs.model.problems.segmentIntersection.AugmentedNode
Construct augmented node as before.

B

BACKWARD - Static variable in class algs.model.network.OptimizedFlowNetwork
Declares a path in the augmenting path follows a backward edge.
BACKWARD - Static variable in class algs.model.network.Search
Declares a path in the augmenting path follows a backward edge.
backward() - Method in class algs.model.network.VertexStructure
Return iterator over backward edges.
BadEvaluator - Class in algs.model.problems.eightpuzzle
Bad evaluation function.
BadEvaluator() - Constructor for class algs.model.problems.eightpuzzle.BadEvaluator
 
BalancedBinaryNode<K,V> - Class in algs.model.tree
Standard node for an unbalanced binary tree.
BalancedBinaryNode(K, V, BalancedBinaryNode<K, V>) - Constructor for class algs.model.tree.BalancedBinaryNode
Make a new node with given key, value, and parent, and with null child links, and BLACK color.
BalancedTree<K,V> - Class in algs.model.tree
Balanced Tree, based on stripped down implementation of TreeMap which is itself an implementation of the algorithm as described in Cormen, Leiserson, and Rivest's Introduction to Algorithms (Cormen et al, 2001).
BalancedTree() - Constructor for class algs.model.tree.BalancedTree
Constructs an empty Balanced Tree.
BalancedTree(Comparator<? super K>) - Constructor for class algs.model.tree.BalancedTree
Constructs a new, empty map, sorted according to the given comparator.
BalancedTreeAndrew - Class in algs.model.problems.convexhull.balanced
Computes Convex Hull following Andrew's Algorithm.
BalancedTreeAndrew() - Constructor for class algs.model.problems.convexhull.balanced.BalancedTreeAndrew
 
below - Variable in class algs.model.kdtree.DimensionalNode
Node below this one.
bestMove(IGameState, IPlayer, IPlayer) - Method in class algs.model.gametree.AlphaBetaEvaluation
Initiates the AlphaBeta computations by determining the maximum number of moves in advance to look.
bestMove(IGameState, IPlayer, IPlayer) - Method in class algs.model.gametree.debug.AlphaBetaEvaluation
Initiates the AlphaBeta computations by determining the maximum number of moves in advance to look.
bestMove(IGameState, IPlayer, IPlayer) - Method in class algs.model.gametree.debug.MinimaxEvaluation
Initiates the MiniMax computations by determining the maximum number of moves in advance to look.
bestMove(IGameState, IPlayer, IPlayer) - Method in class algs.model.gametree.debug.NegMaxEvaluation
Initiates the MiniMax computations by determining the maximum number of moves in advance to look.
bestMove(IGameState, IPlayer, IPlayer) - Method in interface algs.model.gametree.IEvaluation
For game state, player and opponent, return the best move.
bestMove(IGameState, IPlayer, IPlayer) - Method in class algs.model.gametree.MinimaxEvaluation
Initiates the MiniMax computations by using its ply to determine the maximum number of moves in advance to look.
bestMove(IGameState, IPlayer, IPlayer) - Method in class algs.model.gametree.NegMaxEvaluation
Initiates the NegMax computations by using its ply to determine the number of moves in advance to look.
BFS_SearchArray - Class in algs.model.network
Encapsulate algorithm by which the augmenting path for a flow network is found.
BFS_SearchArray(FlowNetwork<EdgeInfo[][]>) - Constructor for class algs.model.network.BFS_SearchArray
 
BFS_SearchList - Class in algs.model.network
Encapsulate algorithm by which the augmenting path for a flow network is found when the underlying data structure is represented as an adjacency list.
BFS_SearchList(FlowNetwork<VertexStructure[]>) - Constructor for class algs.model.network.BFS_SearchList
 
BinaryHeap<E extends java.lang.Comparable<E>> - Class in algs.model.heap
A Binary Heap that can be used as a Priority Queue since it enables elements to have its priority updated while in queue.
BinaryHeap(int) - Constructor for class algs.model.heap.BinaryHeap
Construct Binary Heap of the given size.
BinaryNode<T extends java.lang.Comparable> - Class in algs.model.tree
Standard node for an unbalanced binary tree.
BinaryNode(T) - Constructor for class algs.model.tree.BinaryNode
Default BinaryTree constructor.
BinarySearch<T extends java.lang.Comparable<T>> - Class in algs.model.search
Binary Search in Java given a pre-sorted array of the parameterized type.
BinarySearch() - Constructor for class algs.model.search.BinarySearch
 
BinaryTree<T extends java.lang.Comparable> - Class in algs.model.tree
Standard unbalanced binary tree.
BinaryTree() - Constructor for class algs.model.tree.BinaryTree
Default BinaryTree constructor.
BinaryTreeDebugger - Class in algs.model.tree.debug
Debugging subclass for binary trees.
BinaryTreeDebugger() - Constructor for class algs.model.tree.debug.BinaryTreeDebugger
 
BipartiteMatching - Class in algs.model.network.matching
Computes a matching in a bipartite graph whose vertices are divided into two distinct sets S and T and whose edges only exist between vertices in S and vertices in T.
BipartiteMatching(Object[], Object[], Object[][]) - Constructor for class algs.model.network.matching.BipartiteMatching
Construct matching instance from information.
BipartiteMatchingMinCost - Class in algs.model.network
A graph represents provide nodes that are to be matched with an equal number of requirer nodes.
BipartiteMatchingMinCost(DisjointPairs) - Constructor for class algs.model.network.BipartiteMatchingMinCost
Construct a Bipartite Matching problem instance from the information contained within the DisjointPairs class.
BLACK - Static variable in class algs.model.tree.BalancedBinaryNode
Value to use when node is a BLACK node.
board() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
Expose board state.
BoardEvaluation - Class in algs.model.problems.tictactoe.model
Evaluation of the board state as taken from Nilsson, p.
BoardEvaluation() - Constructor for class algs.model.problems.tictactoe.model.BoardEvaluation
 
boundingRectangle() - Method in interface algs.model.ICircle
return bounding rectangle for this circle.
boundingRectangle() - Method in class algs.model.twod.TwoDCircle
 
BreadthFirstOrdering - Static variable in class algs.debug.DottyDebugger
 
BreadthFirstSearch - Class in algs.model.searchtree
Given an initial state and a target goal state, expand in breadth-first manner all available moves until the target goal state is reached.
BreadthFirstSearch() - Constructor for class algs.model.searchtree.BreadthFirstSearch
 
BreadthFirstSearch - Class in algs.model.searchtree.debug
Given an initial state and a target goal state, expand in breadth-first manner all available moves until the target goal state is reached.
BreadthFirstSearch() - Constructor for class algs.model.searchtree.debug.BreadthFirstSearch
 
BruteForceAlgorithm - Class in algs.model.problems.segmentIntersection
Brute-force implementation of Line Segment intersection.
BruteForceAlgorithm() - Constructor for class algs.model.problems.segmentIntersection.BruteForceAlgorithm
Default constructor.
BruteForceNearestNeighbor - Class in algs.model.problems.nearestNeighbor
Brute Force implementation of Nearest Neighbor Query.
BruteForceNearestNeighbor(IMultiPoint[]) - Constructor for class algs.model.problems.nearestNeighbor.BruteForceNearestNeighbor
Store all points to compute nearest neighbor queries.
BruteForceRangeQuery - Class in algs.model.problems.rangeQuery
Brute Force implementation of Range Query.
BruteForceRangeQuery(IPoint[]) - Constructor for class algs.model.problems.rangeQuery.BruteForceRangeQuery
Search points pulled from IPoint array.
BruteForceRangeQuery(IMultiPoint[]) - Constructor for class algs.model.problems.rangeQuery.BruteForceRangeQuery
Search points pulled from IMultiPoint array.
BucketAndrew - Class in algs.model.problems.convexhull.bucket
Computes Convex Hull following Andrew's Algorithm.
BucketAndrew() - Constructor for class algs.model.problems.convexhull.bucket.BucketAndrew
 

C

capacity - Variable in class algs.model.network.EdgeInfo
Capacity over the edge.
cell(int, int) - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Return contents of cell[r][c].
cell(int, int) - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Return contents of cell[r][c].
Cell - Class in algs.model.problems.tictactoe.model
Represents a column, row location on the TicTacToe board.
Cell(int, int) - Constructor for class algs.model.problems.tictactoe.model.Cell
Constructs a Cell object given a column and row.
Cell(Cell) - Constructor for class algs.model.problems.tictactoe.model.Cell
Copy constructor.
cells - Variable in class algs.model.problems.tictactoe.model.TicTacToeBoard
Store data as a 3x3 array of cells.
checkInterval(IInterval) - Method in class algs.model.interval.SegmentTree
Used to validate IInterval before being incorporated into this data structure.
checkInterval(IInterval) - Method in class algs.model.interval.SegmentTreeNode
Used to validate IInterval before being incorporated into this data structure.
checkInterval(int, int) - Method in class algs.model.interval.SegmentTreeNode
Used to validate [left, right) interval before being incorporated into this data structure.
CircleGenerator - Class in algs.model.data.points
Generators of sample data points along the edge of a circle whose origin is (0,0) and has the given radius (defaults to 1).
CircleGenerator() - Constructor for class algs.model.data.points.CircleGenerator
Construct default generator with radius of 1.
CircleGenerator(int) - Constructor for class algs.model.data.points.CircleGenerator
Construct generator with given radius.
clear(int, int) - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Clears the cell at given location.
clear() - Method in class algs.model.tree.BalancedTree
Empty out the tree.
ClosedStates - Class in algs.model.searchtree
Maintains the set of closed states in ordered fashion, so the state with the lowest evaluation function can be removed.
ClosedStates() - Constructor for class algs.model.searchtree.ClosedStates
 
COINCIDENT - Static variable in interface algs.model.ILineSegment
 
col - Variable in class algs.model.problems.tictactoe.model.Cell
The column for the board location.
col - Variable in class algs.model.problems.tictactoe.model.PlaceMark
The column to contain the mark.
color - Variable in class algs.model.tree.BalancedBinaryNode
Color.
color(boolean) - Method in class algs.model.tree.BalancedBinaryNode
Set node color.
color() - Method in class algs.model.tree.BalancedBinaryNode
Get node color.
comparator - Variable in class algs.model.tree.BalancedTree
Comparator used to maintain order in this BalancedTree.
comparator() - Method in class algs.model.tree.BalancedTree
Returns the comparator used to order this map, or null if this map uses its keys' natural order.
compare(double, double) - Static method in class algs.model.FloatingPoint
Return -1 if d1 < d2, 0 if d1 == d2, or +1 if d1 > d2.
compare(IMultiPoint, IMultiPoint) - Method in class algs.model.kdtree.DimensionalComparator
Compare the two points against a given dimension.
compare(EventPoint, EventPoint) - Method in class algs.model.problems.segmentIntersection.EventPoint
Comparison assumes a horizontal sweep line starting from the top and sweeping down the plane.
compare(K, K) - Method in class algs.model.tree.BalancedTree
Compares two keys using the correct comparison method for this BalancedTree.
compareTo(EightPuzzleNode) - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Offer rudimentary compareTo method by comparing boards.
compareTo(FifteenPuzzleNode) - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Offer rudimentary compareTo method by comparing boards.
complete() - Method in class algs.debug.DottyDebugger
All is ready to be processed.
complete() - Method in interface algs.debug.IDebugSearch
Complete any processing to make this information available.
compute() - Method in class algs.model.network.FordFulkerson
Compute the Maximal flow for the given flow network.
compute() - Method in class algs.model.network.matching.BipartiteMatching
Compute a solution to the FlowNetwork problem and find all edges in the solution whose flow is 1, since these are valid solutions to the matching problem.
compute(int, int) - Method in class algs.model.network.Optimized
 
compute(int, int) - Method in class algs.model.network.OptimizedFlowNetwork
Compute the Maximal flow for the given flow network.
compute(IPoint[]) - Method in class algs.model.problems.convexhull.andrew.ConvexHullScan
Use Andrew's algorithm to return the computed convex hull for the input set of points.
compute(IPoint[]) - Method in class algs.model.problems.convexhull.andrew.ConvexHullScanLinkedList
Use Andrew's algorithm to return the computed convex hull for the input set of points.
compute(IPoint[]) - Method in class algs.model.problems.convexhull.balanced.BalancedTreeAndrew
 
compute(IPoint[]) - Method in class algs.model.problems.convexhull.bucket.BucketAndrew
 
compute(IPoint[]) - Method in class algs.model.problems.convexhull.heap.HeapAndrew
Use Andrew's algorithm to return the computed convex hull for the input set of points.
compute(IPoint[]) - Method in interface algs.model.problems.convexhull.IConvexHull
Return the computed convex hull for the input set of IPoint objects.
compute(IPoint[]) - Method in class algs.model.problems.convexhull.slowhull.SlowHull
Use SlowHull algorithm to return the computed convex hull for the input set of points.
compute(IPoint[], int, int) - Static method in class algs.model.problems.convexhull.slowhull.SlowHull
Compute the angle between the vertical line based at leftMostX and the line between points[leftMostX] and points[i].
compute(SegmentTree<StoredIntervalsNode>, int) - Static method in class algs.model.problems.EnclosingIntervalSearch
Return the computed set.
computeTable() - Method in class algs.model.tests.common.TrialSuite
Produce full table of information.
computeTime() - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
 
concat(DoubleLinkedList<E>) - Method in class algs.model.list.DoubleLinkedList
Concatenate the two lists.
concat(List<E>) - Method in class algs.model.list.List
Concatenate a list to the end of our list.
construct(String[]) - Method in class algs.model.data.circles.UniformGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.Generator
Given the string arguments, construct the desired generator as specified by the appropriate sub-class.
construct(String[]) - Method in class algs.model.data.nd.ConvertToND
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.nd.UniformGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.points.CircleGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.points.HorizontalLineGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.points.LoadFromFileGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.points.UniformGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.points.UniqueGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.points.UnusualGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.points.VerticalLineGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.segments.DoubleGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.segments.GridGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.segments.HubGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.segments.IntegerGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.segments.LoadFromFileGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.segments.SlidingLadderGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(String[]) - Method in class algs.model.data.segments.UniformGenerator
Provide reflective behavior to construct instance of generator given an array of string arguments.
construct(int, int) - Method in interface algs.model.interval.IConstructor
Instantiate the actual node.
construct(IMultiPoint) - Method in class algs.model.kdtree.DimensionalNode
This method constructs the node of the appropriate class based upon the dimensional property of this node.
construct(IPoint) - Method in class algs.model.kdtree.HorizontalNode
This method constructs the node of the appropriate class based upon the vertical property of this node.
construct(IPoint) - Method in class algs.model.kdtree.TwoDNode
This method constructs the node of the appropriate class based upon the vertical property of this node.
construct(IPoint) - Method in class algs.model.kdtree.VerticalNode
This method constructs the node of the appropriate class based upon the vertical property of this node.
construct(int) - Static method in class algs.model.network.VertexStructure
Construct an array of VertexStructure objects, where each element is pre-initialized to a new VertexStructure.
construct(K, K, AugmentedNode<K>) - Method in class algs.model.problems.segmentIntersection.AugmentedBalancedTree
Construct a node in the tree.
construct(K, V, BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedTree
Construct a node in the tree.
constructor - Static variable in class algs.model.interval.SegmentTreeNode
Default Constructor to use for all SegmentTrees.
constructor - Static variable in class algs.model.interval.StoredIntervalsNode
Constructor to use with this node type.
contains(IHypercube) - Method in interface algs.model.IHypercube
Determine if the hypercube wholly contains the given hypercube h.
contains(Object) - Method in class algs.model.interval.SegmentTree
This method must be rewritten because it is used to determine if the given IInterval is stored within the Segment tree.
contains(IRectangle) - Method in interface algs.model.IRectangle
Determine if rectangle contains the given rectangle r.
contains(E) - Method in class algs.model.list.DoubleLinkedList
Determine membership by returning element if found.
contains(E) - Method in class algs.model.list.List
Determine membership by returning element if found.
contains(IHypercube) - Method in class algs.model.nd.Hypercube
Determine if the hypercube wholly contains the given hypercube h.
contains(EventPoint) - Method in class algs.model.problems.segmentIntersection.EventQueue
Determine whether event point already exists within the queue.
contains(EventPoint) - Method in class algs.model.problems.segmentIntersection.priorityqueue.SlowEventQueue
Determine whether event point already exists within the queue.
contains(INode) - Method in class algs.model.searchtree.ClosedStates
Determine if the given state is contained.
contains(INode) - Method in interface algs.model.searchtree.INodeSet
Return the actual node in storage that is equal to the given node.
contains(INode) - Method in class algs.model.searchtree.states.StateHash
Locate element stored in set that equals n.
contains(INode) - Method in class algs.model.searchtree.states.StateOrdered
Determine if contained within the set.
contains(INode) - Method in class algs.model.searchtree.states.StateQueue
 
contains(INode) - Method in class algs.model.searchtree.states.StateStack
A costly operation in a stack; typically not required.
contains(INode) - Method in class algs.model.searchtree.states.StateTree
Locate element within the set whose score is the same.
contains(IRectangle) - Method in class algs.model.twod.TwoDRectangle
Determines containment of the given rectangle within the closed Rectangular region.
convert(int) - Static method in class algs.debug.IGraphEntity.Formatter
Helper method for converting values into properly visible labels.
convert(IPoint[]) - Static method in class algs.model.data.nd.ConvertToND
Utility function to construct an IMultiPoint[] array from an IPoint[] array.
ConvertToND - Class in algs.model.data.nd
Wrapper generator that converts IPoint arrays into IMultiPoint object arrays.
ConvertToND(Generator<IPoint>) - Constructor for class algs.model.data.nd.ConvertToND
 
ConvexHullScan - Class in algs.model.problems.convexhull.andrew
Computes Convex Hull following Andrew's Algorithm.
ConvexHullScan() - Constructor for class algs.model.problems.convexhull.andrew.ConvexHullScan
 
ConvexHullScanLinkedList - Class in algs.model.problems.convexhull.andrew
Computes Convex Hull following Andrew's Algorithm with linked lists.
ConvexHullScanLinkedList() - Constructor for class algs.model.problems.convexhull.andrew.ConvexHullScanLinkedList
 
coord - Variable in class algs.model.kdtree.DimensionalNode
Coordinate in this dimension from the multipoint.
coord - Variable in class algs.model.kdtree.TwoDNode
Coordinate.
copy() - Method in class algs.model.gametree.debug.AlphaBetaDebugNode
Generate copy of this node.
copy() - Method in interface algs.model.gametree.IGameState
Enable one to grab a copy of this game state.
copy() - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Return a copy of the game state.
copy() - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Return a copy of the game state.
copy() - Method in class algs.model.problems.tictactoe.model.Logic
Each logic must implement 'copy' to properly be used when evaluating future moves.
copy() - Method in class algs.model.problems.tictactoe.model.StraightLogic
Each logic must implement 'copy' to properly be used when evaluating future moves.
copy() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
Copy full state information.
copy() - Method in interface algs.model.searchtree.INode
Enable one to grab a copy of this board state.
cost - Variable in class algs.model.network.EdgeInfo
Shipping cost for this edge.
count() - Method in class algs.model.kdtree.KDTree
Helper method for testing.
counter() - Method in class algs.model.gametree.debug.AlphaBetaDebugNode
Retrieve the unique identifier for this node.
counter() - Method in interface algs.model.gametree.IGameState
Debugging interface for retrieving counter.
counter() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
 
CounterKDTree - Class in algs.model.kdtree
Helper class to simply keep track of the number of selected nodes that are visited by a traversal.
CounterKDTree() - Constructor for class algs.model.kdtree.CounterKDTree
 
create(int) - Static method in class algs.model.searchtree.states.StateStorageFactory
 
CreateImage - Class in algs.model.network.debug
Given a FlowNetwork object, use the DottyDebugger to represent the flow graph.
CreateImage() - Constructor for class algs.model.network.debug.CreateImage
 
createPlayer(String, char) - Static method in class algs.model.problems.tictactoe.model.PlayerFactory
Create a player just by the type.
createPlayerWithPly(String, char, int) - Static method in class algs.model.problems.tictactoe.model.PlayerFactory
Create player with a fixed ply lookahead.

D

d - Variable in class algs.model.kdtree.DimensionalComparator
The dimension against which the points are being compared.
dd - Variable in class algs.model.network.debug.CreateImage
Debugger to use, which defaults to having directed edges shown.
debug(IDebugSearch) - Method in class algs.model.gametree.debug.AlphaBetaEvaluation
Install debugger to use.
debug(IDebugSearch) - Method in class algs.model.gametree.debug.MinimaxEvaluation
Install debugger to use.
debug(IDebugSearch) - Method in class algs.model.gametree.debug.NegMaxEvaluation
Install debugger to use.
debug - Static variable in class algs.model.problems.eightpuzzle.EightPuzzleNode
Since this node is responsible for its formatted output in debugging, we place that localized control here.
debug(IDebugSearch) - Method in class algs.model.searchtree.debug.AStarSearch
Set the debugger to use when searching (or null to turn off).
debug(IDebugSearch) - Method in class algs.model.searchtree.debug.BreadthFirstSearch
Set the debugger to use when searching (or null to turn off).
debug(IDebugSearch) - Method in class algs.model.searchtree.debug.DepthFirstSearch
Set the debugger to use when searching (or null to turn off).
decideMove(IGameState) - Method in class algs.model.problems.tictactoe.model.IntelligentAgent
Make an intelligent move given the board state, game logic, and player making the move.
decideMove(IGameState) - Method in class algs.model.problems.tictactoe.model.Player
Decide upon a move with the given board state.
decideMove(IGameState) - Method in class algs.model.problems.tictactoe.model.RandomPlayer
Randomly make a move based upon the available logic of the game.
decreaseKey(int, Comparable<E>) - Method in class algs.model.heap.BinaryHeap
Decrease the priority of the known element in the Binary Heap with the given identifier.
DefaultEvaluation - Class in algs.model.problems.tictactoe.model
Evaluation of the board state.
DefaultEvaluation() - Constructor for class algs.model.problems.tictactoe.model.DefaultEvaluation
 
defaultFontName - Static variable in class algs.debug.DottyDebugger
 
defaultFontSize - Static variable in class algs.debug.DottyDebugger
These fonts are embeddable within PDF documents.
DefaultNodeDrawer - Class in algs.debug.drawers
Capable of drawing default nodes in the DOTTY debugging output.
DefaultNodeDrawer() - Constructor for class algs.debug.drawers.DefaultNodeDrawer
 
deleteEntry(BalancedBinaryNode<K, K>) - Method in class algs.model.problems.segmentIntersection.AugmentedBalancedTree
Because we are using leaf nodes only to store the segments, we can be guaranteed that the node p is going to be a leaf node.
deleteEntry(BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedTree
Delete node p, and then rebalance the tree.
deleteRange(AugmentedNode<ILineSegment>, AugmentedNode<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.LineState
Delete everything from the successor of left until the successor of left is right.
deleteRange(DoubleNode<ILineSegment>, DoubleNode<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.linkedlist.LinkedListLineState
Delete all line segments from the state in the range (left, right).
depth - Variable in class algs.model.searchtree.DepthTransition
Depth away from the initial board state.
DepthFirstOrdering - Static variable in class algs.debug.DottyDebugger
Ordering types.
DepthFirstSearch - Class in algs.model.searchtree.debug
Given an initial state, a target goal state, expand in depth-first manner all available moves until the target goal state is reached.
DepthFirstSearch() - Constructor for class algs.model.searchtree.debug.DepthFirstSearch
Construct a depth-first search entity with no fixed depth.
DepthFirstSearch(int) - Constructor for class algs.model.searchtree.debug.DepthFirstSearch
Construct a depth-fixed search entity.
DepthFirstSearch - Class in algs.model.searchtree
Given an initial state, a target goal state, expand in breadth-first manner all available moves until the target goal state is reached.
DepthFirstSearch() - Constructor for class algs.model.searchtree.DepthFirstSearch
Depth-First with no bound.
DepthFirstSearch(int) - Constructor for class algs.model.searchtree.DepthFirstSearch
Initiate the Depth First Search with the given fixed-depth bound to search.
DepthTransition - Class in algs.model.searchtree
Records the depth of the transition between board states.
DepthTransition(IMove, INode, int) - Constructor for class algs.model.searchtree.DepthTransition
Record the move and previous state of this transition.
determineIntersecting(EventPoint, AugmentedNode<ILineSegment>, AugmentedNode<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.LineState
Only intersections are allowed with neighboring segments in the line state.
DFS_SearchArray - Class in algs.model.network
Encapsulate algorithm by which the augmenting path for a flow network is found.
DFS_SearchArray(FlowNetwork<EdgeInfo[][]>) - Constructor for class algs.model.network.DFS_SearchArray
 
DFS_SearchList - Class in algs.model.network
Encapsulate algorithm by which the augmenting path for a flow network is found.
DFS_SearchList(FlowNetwork<VertexStructure[]>) - Constructor for class algs.model.network.DFS_SearchList
 
dimension - Variable in class algs.model.kdtree.DimensionalNode
Which dimension is being represented (1 <= d <= max).
DimensionalComparator - Class in algs.model.kdtree
Able to compare IMultiPoint objects using a fixed dimensional index to select the value against which to compare.
DimensionalComparator(int) - Constructor for class algs.model.kdtree.DimensionalComparator
Construct with the given dimensional index (d >= 1).
dimensionality() - Method in interface algs.model.IHypercube
return the dimensionality of this hypercube.
dimensionality() - Method in interface algs.model.IMultiLineSegment
Return the dimensionality of this line segment.
dimensionality() - Method in interface algs.model.IMultiPoint
Return the dimensionality of this point.
dimensionality() - Method in class algs.model.nd.Hypercube
Return the dimensionality of this hypercube.
dimensionality() - Method in class algs.model.nd.Hyperpoint
 
dimensionality() - Method in class algs.model.twod.TwoDLineSegment
 
dimensionality() - Method in class algs.model.twod.TwoDPoint
 
DimensionalNode - Class in algs.model.kdtree
Represents a node in the KD-tree that partitions the space by means of a plane that splits the hyperspace into an "above" and a "below" based upon orientation.
DimensionalNode(int, IMultiPoint) - Constructor for class algs.model.kdtree.DimensionalNode
Dimensional-coordinate is passed in as the value, together with its dimension.
dimensions - Variable in class algs.model.data.nd.UniformGenerator
Points are assigned this number of dimensions.
discarded - Variable in class algs.debug.DottyDebugger
Nodes that appear in the search output but which have now been discarded.
DiscardedNodeDrawer - Class in algs.debug.drawers
Capable of drawing discarded nodes in the DOTTY debugging output.
DiscardedNodeDrawer() - Constructor for class algs.debug.drawers.DiscardedNodeDrawer
 
DiscreteInterval - Class in algs.model.interval
Represents a discrete interval [left,right) that implements IInterval.
DiscreteInterval(int, int) - Constructor for class algs.model.interval.DiscreteInterval
Create a discrete interval whose left is strictly less than its right.
DisjointPairs<A,B> - Class in algs.model.network
Helper class to record pairing information for the Maximum Matching problem.
DisjointPairs() - Constructor for class algs.model.network.DisjointPairs
 
dispose(IInterval) - Method in class algs.model.interval.SegmentTreeNode
Algorithms over SegmentTrees often store additional information with each node, and may wish to clear information and/or perform computations when a segment is deleted.
dispose(IInterval) - Method in class algs.model.interval.StoredIntervalsNode
Algorithms over SegmentTrees often store additional information with each node, and may wish to clear information and/or perform computations when a segment is deleted.
distance(IMultiPoint) - Method in interface algs.model.IMultiPoint
Return the Euclidean distance between the given IMultiPoint object.
distance(IMultiPoint) - Method in class algs.model.nd.Hyperpoint
Return the Euclidean distance between the given IMultiPoint.
distance(IMultiPoint) - Method in class algs.model.twod.TwoDPoint
Return the Euclidean distance between the given multipoint.
DottyDebugger - Class in algs.debug
Produces a text string that can be used as input to the DOT program [http://www.graphviz.org].
DottyDebugger() - Constructor for class algs.debug.DottyDebugger
 
DoubleGenerator - Class in algs.model.data.segments
Generators of sample lines using doubles coordinated within the [max, max] box whose segment distance is length.
DoubleGenerator(double, double) - Constructor for class algs.model.data.segments.DoubleGenerator
Prepare generator with boundaries of the square together with the desired length of line segments to create.
DoubleLinkedList<E> - Class in algs.model.list
Maintain doubly-linked list of entities.
DoubleLinkedList() - Constructor for class algs.model.list.DoubleLinkedList
Construct double linked list with no comparator (defaults to append on insert).
DoubleLinkedList(Comparator<E>) - Constructor for class algs.model.list.DoubleLinkedList
Construct double linked list with comparator.
DoubleLinkedListIterator<E> - Class in algs.model.list
Provide minimal iterator to walk through the next pointers in the DoubleLinkedList.
DoubleLinkedListIterator(DoubleLinkedList<E>) - Constructor for class algs.model.list.DoubleLinkedListIterator
Constructor for the iterator over the list.
DoubleNode<E> - Class in algs.model.list
Double Linked list of elements parameterized by class E.
DoubleNode(E) - Constructor for class algs.model.list.DoubleNode
Construct node from the given element.
drain(DimensionalNode) - Method in class algs.model.kdtree.CounterKDTree
 
drain(DimensionalNode) - Method in interface algs.model.kdtree.IVisitKDNode
Specialized behavior during search traversals when an entire sub-tree is visited.
drain(TwoDNode) - Method in interface algs.model.kdtree.IVisitTwoDNode
Specialized behavior during search traversals when an entire sub-tree is visited.
drain(DimensionalNode) - Method in class algs.model.kdtree.KDTraversal
During a regular traversal, drain is not invoked.
drain(TwoDNode) - Method in class algs.model.kdtree.TwoDTraversal
This drain is never invoked during the node-by-node traversal and it is implemented here to avoid subclasses from mistakenly thinking that they need to implement it.
draw(IGraphEntity) - Method in class algs.debug.drawers.DefaultNodeDrawer
Default node is drawn simply using its node label.
draw(IGraphEntity) - Method in class algs.debug.drawers.DiscardedNodeDrawer
Discarded nodes are drawn in grayscale.
draw(IGraphEntity) - Method in class algs.debug.drawers.GoalNodeDrawer
Goal node is drawn as a pentagon.
draw(IGraphEntity) - Method in class algs.debug.drawers.InitialNodeDrawer
Half-grayscale colored nodes.
draw(IGraphEntity) - Method in class algs.debug.drawers.UnexploredNodeDrawer
60% drawn color with fonts in 20% color and a background fill to show that this node is unexplored.
draw(IGraphEntity) - Method in interface algs.debug.INodeDrawer
Return the proper formatting for the given node.

E

edge(int, int) - Method in class algs.model.network.FlowNetwork
Subclasses provide this implementation, based upon their data structures.
edge(int, int) - Method in class algs.model.network.FlowNetworkAdjacencyList
Given an adjacency list for vertex 'n', find the edge (if it exists) from start to end.
edge(int, int) - Method in class algs.model.network.FlowNetworkArray
 
edge(int, int) - Method in class algs.model.network.Optimized
 
EdgeInfo - Class in algs.model.network
This class is used to model the edges of the graph which contains a network flow problem.
EdgeInfo(int, int, int) - Constructor for class algs.model.network.EdgeInfo
Construct EdgeInfo from (start,end) vertices with given capacity.
EdgeInfo(int, int, int, int) - Constructor for class algs.model.network.EdgeInfo
Construct EdgeInfo from (start,end) vertices with given capacity.
edges - Variable in class algs.debug.DottyDebugger
Edges.
edgeType() - Method in class algs.debug.DottyDebugger
Edges should be undirected.
edgeType() - Method in class algs.model.tree.debug.BinaryTreeDebugger
Default to having nodes with complex record shapes.
edgeType() - Method in class algs.model.tree.debug.RightThreadTreeDebugger
Default to having nodes with complex record shapes.
EightPuzzleNode - Class in algs.model.problems.eightpuzzle
Represents a node in the Eight-Puzzle space.
EightPuzzleNode(int[][]) - Constructor for class algs.model.problems.eightpuzzle.EightPuzzleNode
Constructor for initiating and copying the state.
element - Variable in class algs.model.network.matching.Pair
Element from set S.
EMPTY - Static variable in class algs.model.problems.tictactoe.model.TicTacToeBoard
Empty Marker.
EmptyMark - Static variable in class algs.model.problems.eightpuzzle.EightPuzzleNode
Empty Mark.
EmptyMark - Static variable in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Empty Mark.
EnclosingIntervalSearch - Class in algs.model.problems
Given a set S of n intervals and a query point q, report all of those intervals that contain q.
end - Variable in class algs.model.network.EdgeInfo
End of edge.
end - Variable in class algs.model.twod.TwoDLineSegment
Store Line segment end.
epsilon - Static variable in class algs.model.FloatingPoint
Numbers within this amount are considered to be the same.
equals(Object) - Method in interface algs.model.ICircle
Must properly compute equals(Object) to compare based origin and radius
equals(Object) - Method in class algs.model.interval.DiscreteInterval
Compare DiscreteInterval objects.
equals(Object) - Method in class algs.model.interval.SegmentTreeNode
Determine the matching test.
equals(Object) - Method in class algs.model.interval.StoredIntervalsNode
Determine the matching test.
equals(Object) - Method in interface algs.model.IRectangle
Must properly compute equals(Object) to compare based on getXXX() values.
equals(Object) - Method in class algs.model.nd.Hypercube
Determine equality by comparing coordinates on each dimension
equals(Object) - Method in class algs.model.nd.Hyperpoint
Supports the equals checking of IMultiPoint objects.
equals(Object) - Method in class algs.model.network.EdgeInfo
Support default equals protocol.
equals(Object) - Method in class algs.model.network.matching.Pair
Standard equals method.
equals(Object) - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Determine equals via equivalence of state.
equals(Object) - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Determine equals via equivalence of state.
equals(Object) - Method in class algs.model.problems.segmentIntersection.EventPoint
Need equals method if this class is ever to be used within the collection classes.
equals(Object) - Method in class algs.model.problems.tictactoe.model.Cell
Override equals() method from java.lang.Object.
equals(Object) - Method in class algs.model.problems.tictactoe.model.PlaceMark
Determine equality based on structure.
equals(Object) - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
 
equals(Object) - Method in class algs.model.tree.BalancedBinaryNode
Provide standard equals method.
equals(Object) - Method in class algs.model.twod.TwoDCircle
 
equals(Object) - Method in class algs.model.twod.TwoDLineSegment
Provides the standard equals method.
equals(Object) - Method in class algs.model.twod.TwoDPoint
Provides the required equals method.
equals(Object) - Method in class algs.model.twod.TwoDRectangle
Extend to cover .equals() to any object that implements IRectangle.
equivalent(IGameState) - Method in interface algs.model.gametree.IGameState
Determine if this game state is equivalent to the given state.
equivalent(INode) - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Determine equivalence of state.
equivalent(INode) - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Determine equivalence of state.
equivalent(IGameState) - Method in class algs.model.problems.tictactoe.model.TicTacToeState
Determine whether the state is the same by comparing the board state under eight different rotations and reflections.
equivalent(INode) - Method in interface algs.model.searchtree.INode
Determine if this board state is equivalent to the given state.
eval(IGameState) - Method in interface algs.model.gametree.IPlayer
Return the evaluation of this game state from player's perspective.
eval(INode) - Method in class algs.model.problems.eightpuzzle.BadEvaluator
Eval = g(n) + W(n), where g(n) is length of the path from initial to node n, and W(n) counts number of misplaced tiles in the state description
eval(INode) - Method in class algs.model.problems.eightpuzzle.GoodEvaluator
h^(n) = P(n) + 3*S(n), where P(n) is the sum of the distances (via manhattan metric) that each tile is from "home".
eval(INode) - Method in class algs.model.problems.eightpuzzle.WeakEvaluator
Eval = g(n) + W(n), where g(n) is length of the path from initial to node n, and W(n) counts number of misplaced tiles in the state description
eval(INode) - Method in class algs.model.problems.fifteenpuzzle.GoodEvaluator
h^(n) = P(n) + 4*S(n), where P(n) is the sum of the distances (via manhattan metric) that each tile is from "home".
eval(IGameState) - Method in class algs.model.problems.tictactoe.model.Player
Return the evaluation of this game state from the perspective of the given player.
eval(INode) - Method in interface algs.model.searchtree.IScore
Evaluate the given state and return an integer that is to be used during search algorithms.
event(EventPoint) - Method in class algs.model.problems.segmentIntersection.EventQueue
Determine whether event point already exists within the queue, and return the actual event point within the queue if it does.
event(EventPoint) - Method in class algs.model.problems.segmentIntersection.priorityqueue.SlowEventQueue
Determine whether event point already exists within the queue, and return it if it does.
EventPoint - Class in algs.model.problems.segmentIntersection
The EventPoint is the basic element of the EventQueue.
EventPoint(IPoint) - Constructor for class algs.model.problems.segmentIntersection.EventPoint
Constructor for the Event Point when not an upper (start) endpoint.
eventPointSorter - Static variable in class algs.model.problems.segmentIntersection.EventPoint
Globally useful sorter, sorts points based on a horizontal sweep line moving vertically down the Cartesian plane.
EventQueue - Class in algs.model.problems.segmentIntersection
The EventQueue for a horizontal-sweep line algorithm for line segment intersection.
EventQueue() - Constructor for class algs.model.problems.segmentIntersection.EventQueue
Default constructor.
execute(IGameState) - Method in interface algs.model.gametree.IGameMove
Execute the move on the game state.
execute(INode) - Method in class algs.model.problems.eightpuzzle.SlideMove
Execute the move on the given board state.
execute(INode) - Method in class algs.model.problems.fifteenpuzzle.SlideMove
Execute the move on the given board state.
execute(IGameState) - Method in class algs.model.problems.tictactoe.model.Move
Makes the move on the given TicTacToe Board.
execute(IGameState) - Method in class algs.model.problems.tictactoe.model.PlaceMark
Place a mark on the TicTacToeBoard.
execute(INode) - Method in interface algs.model.searchtree.IMove
Execute the move on the board state.
ExternalBinaryHeap<E> - Class in algs.model.heap
Declared as 'External' since all comparison is external via a provided comparator class.
ExternalBinaryHeap(int, Comparator<E>) - Constructor for class algs.model.heap.ExternalBinaryHeap
Construct a Binary heap of given size.

F

FifteenPuzzleNode - Class in algs.model.problems.fifteenpuzzle
Represents a node in the Fifteen-Puzzle space.
FifteenPuzzleNode(int[][]) - Constructor for class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Constructor for initiating and copying the state.
filters - Static variable in class algs.model.problems.tictactoe.model.TicTacToeBoard
These will reflect the cell ordering.
finalPhase() - Method in class algs.model.tree.AbstractBinaryTraversal
Return the final phase of the traversal.
finalPhase() - Method in class algs.model.tree.InorderTraversal
Final phase for inorder traversal is RIGHT.
finalPhase() - Method in class algs.model.tree.PostorderTraversal
Final phase for postorder traversal is SELF.
finalPhase() - Method in class algs.model.tree.PreorderTraversal
Final phase for preorder traversal is RIGHT.
findAugmentingPath(VertexInfo[]) - Method in class algs.model.network.BFS_SearchArray
 
findAugmentingPath(VertexInfo[]) - Method in class algs.model.network.BFS_SearchList
 
findAugmentingPath(VertexInfo[]) - Method in class algs.model.network.DFS_SearchArray
 
findAugmentingPath(VertexInfo[]) - Method in class algs.model.network.DFS_SearchList
 
findAugmentingPath(int, int) - Method in class algs.model.network.OptimizedFlowNetwork
Locate an augmenting path in the Flow Network from the source vertex to the sink.
findAugmentingPath(VertexInfo[]) - Method in class algs.model.network.Search
Locate an augmenting path in the Flow Network determined by the edge structure information and knowledge of the vertices (such as the number, which one is source and which one is the sink).
findAugmentingPath(VertexInfo[]) - Method in class algs.model.network.ShortestPathArray
Determine whether an augmenting path was found.
first() - Method in class algs.model.list.DoubleLinkedList
Return first element in list.
firstNode() - Method in class algs.model.tree.BalancedTree
Returns the first Entry in the BalancedTree (according to the BalancedTree key-sort function).
FirstSelector - Class in algs.model.array
Quicksort selector during partition that selects leftmost element.
FirstSelector() - Constructor for class algs.model.array.FirstSelector
 
fixAfterInsertion(BalancedBinaryNode<K, K>) - Method in class algs.model.problems.segmentIntersection.AugmentedBalancedTree
 
fixAfterInsertion(BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedTree
From CLR
FloatingPoint - Class in algs.model
Provides a standard API for evaluating double numbers when dealing with floating point rounding error.
FlowNetwork<E> - Class in algs.model.network
Parent abstract class for representing a flow network problem to be solved.
FlowNetwork(int, int, int) - Constructor for class algs.model.network.FlowNetwork
Store relevant information about the FlowNetwork graph.
FlowNetworkAdjacencyList - Class in algs.model.network
Store information regarding the graph as an adjacency list.
FlowNetworkAdjacencyList(int, int, int, Iterator<EdgeInfo>) - Constructor for class algs.model.network.FlowNetworkAdjacencyList
Construct an instance of the FlowNetwork problem using a two-dimensional array to store the edge information.
FlowNetworkArray - Class in algs.model.network
Store information regarding the graph in a two-dimensional matrix.
FlowNetworkArray(int, int, int, Iterator<EdgeInfo>) - Constructor for class algs.model.network.FlowNetworkArray
Construct an instance of the FlowNetwork problem using a two-dimensional array to store the edge information.
FlowNetworkArray(int, int, int) - Constructor for class algs.model.network.FlowNetworkArray
Minimal constructor for use by subclasses.
fontName() - Method in interface algs.debug.ISelectFont
Determine font to use.
fontName() - Method in class algs.model.gametree.debug.AlphaBetaDebugNode
To properly draw Alpha/Beta in symbol font.
fontName() - Method in class algs.model.gametree.debug.MinMaxNode
To properly draw INF/-INF in symbol font.
fontName() - Method in class algs.model.gametree.debug.NegMaxNode
To properly draw Negmax node in symbol font.
fontName() - Method in class algs.model.gametree.debug.ScoreNode
To properly draw Infinity symbols in symbol font.
fontSize() - Method in interface algs.debug.ISelectFont
Determine font size to use.
fontSize() - Method in class algs.model.gametree.debug.AlphaBetaDebugNode
Default font size to use is ok.
fontSize() - Method in class algs.model.gametree.debug.MinMaxNode
Default font size to use is ok.
fontSize() - Method in class algs.model.gametree.debug.NegMaxNode
Default font size to use is ok.
fontSize() - Method in class algs.model.gametree.debug.ScoreNode
Default font size to use is ok.
FordFulkerson - Class in algs.model.network
Given a flow network (see definition below) with known capacities on each directed edge, compute the maximal flow between the source vertex and the sink vertex.
FordFulkerson(FlowNetwork, Search) - Constructor for class algs.model.network.FordFulkerson
Construct instance to compute maximum flow across the given network, using the given search method to find an augmenting path.
FORWARD - Static variable in class algs.model.network.OptimizedFlowNetwork
Declares a path in the augmenting path follows a forward edge.
FORWARD - Static variable in class algs.model.network.Search
Declares a path in the augmenting path follows a forward edge.
forward() - Method in class algs.model.network.VertexStructure
Return iterator over forward edges.
fromC - Variable in class algs.model.problems.eightpuzzle.SlideMove
column coordinate of the move's source.
fromC - Variable in class algs.model.problems.fifteenpuzzle.SlideMove
column coordinate of the move's source.
fromR - Variable in class algs.model.problems.eightpuzzle.SlideMove
row coordinate of the move's source.
fromR - Variable in class algs.model.problems.fifteenpuzzle.SlideMove
row coordinate of the move's source.

G

gameWon() - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Determines whether game has been won.
gameWon(char) - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Determines whether game has been won by given mark.
gather(IInterval) - Method in class algs.model.interval.StoredIntervalsNode
Gather the set of stored intervals that are in common with the given target interval.
generate(int) - Method in class algs.model.data.circles.UniformGenerator
Generate a set of uniform circles points in the range: with given radius.
generate(int) - Method in class algs.model.data.Generator
Generate a set of elements according to specialized criteria defined by the subclass.
generate(int) - Method in class algs.model.data.nd.ConvertToND
Invoke inner generator and convert all to IMultiPoint.
generate(int) - Method in class algs.model.data.nd.UniformGenerator
Generate a set of uniform random points in the range:
generate(int) - Method in class algs.model.data.points.CircleGenerator
Generate a set of |size| points along the edge of a circle, thus ensuring that all points belong to the convex hull.
generate(int) - Method in class algs.model.data.points.HorizontalLineGenerator
Generate a set of |size| points all along a horizontal line (x,99).
generate(int) - Method in class algs.model.data.points.LoadFromFileGenerator
 
generate(int) - Method in class algs.model.data.points.UniformGenerator
Generate a set of uniform random points in the range:
generate(int) - Method in class algs.model.data.points.UniqueGenerator
Generate a set of |size| points in the plane.
generate(int) - Method in class algs.model.data.points.UnusualGenerator
Generate a set of |size| points all clustered into four regions, each located at the corners of a rectangle of width and height of maxValue.
generate(int) - Method in class algs.model.data.points.VerticalLineGenerator
Generate a set of |size| points all along a vertical line
generate(int) - Method in class algs.model.data.segments.DoubleGenerator
Generate a random set of segments within a [max,max] box, extending potentially out to a larger range based upon the length of each line segment.
generate(int) - Method in class algs.model.data.segments.GridGenerator
Generate grid of horizontal and vertical lines based on max.
generate(int) - Method in class algs.model.data.segments.HubGenerator
Given an (x,y) coordinate, create a number of lines all intersecting at that location but not each other.
generate(int) - Method in class algs.model.data.segments.IntegerGenerator
Generate a random set of segments within a [max,max] box, extending potentially out to a larger range based upon the length of each line segment.
generate(int) - Method in class algs.model.data.segments.LoadFromFileGenerator
 
generate(int) - Method in class algs.model.data.segments.SlidingLadderGenerator
Generate a random set of points within a [1,1] box, extending potentially out to a larger range based upon the length of each line segment.
generate(int) - Method in class algs.model.data.segments.UniformGenerator
Generate a random set of points within a [1,1] box, extending potentially out to a larger range based upon the length of each line segment.
generate(IMultiPoint[]) - Static method in class algs.model.kdtree.KDFactory
Generate a KDTree from the given array of points.
generate(IPoint[]) - Static method in class algs.model.kdtree.KDFactory
Generate a KDTree from the given array of IPoints.
generate(IPoint[]) - Static method in class algs.model.kdtree.TwoDFactory
Generate a TwoDTree from the given array of points.
Generator<E> - Class in algs.model.data
Generator of a fixed number of elements.
Generator() - Constructor for class algs.model.data.Generator
 
get(int) - Method in class algs.model.network.debug.CreateImage
Get the node identified by the integer index.
get(int, int) - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Returns marker at given spot.
getAbove() - Method in class algs.model.kdtree.DimensionalNode
Return node "Above" this one.
getAbove() - Method in class algs.model.kdtree.TwoDNode
Return node "Above" this one.
getAverage(long) - Method in class algs.model.tests.common.TrialSuite
Return a single average, if it exists in the table.
getBelow() - Method in class algs.model.kdtree.DimensionalNode
Return node "Below" this one.
getBelow() - Method in class algs.model.kdtree.TwoDNode
Return node "Below" this one.
getBottom() - Method in interface algs.model.IRectangle
return the y-coordinate value for the bottom.
getBottom() - Method in class algs.model.twod.TwoDRectangle
Return bottom of rectangle.
getColumn() - Method in class algs.model.problems.tictactoe.model.PlaceMark
Return the column for this move.
getConstructor() - Method in class algs.model.interval.SegmentTree
For those SegmentTrees that demand different class of nodes as the base element of the Tree, this method tells us the constructor being used.
getCoordinate(int) - Method in interface algs.model.IMultiPoint
Return the coordinate value in the given dimension for the given point.
getCoordinate(int) - Method in class algs.model.nd.Hyperpoint
All coordinates are 1-based.
getCoordinate(int) - Method in class algs.model.twod.TwoDPoint
 
getCost() - Method in class algs.model.network.FlowNetwork
Return the cost of the network solution.
getCost() - Method in class algs.model.network.FlowNetworkAdjacencyList
 
getCost() - Method in class algs.model.network.FlowNetworkArray
 
getCost() - Method in class algs.model.network.Optimized
The optimized Ford-Fulkerson is not able to process costs.
getCost() - Method in class algs.model.network.Transshipment
Return the computed minimum cost for this solution.
getCount() - Method in class algs.model.interval.SegmentTreeNode
Return the count associated with this node.
getCount() - Method in class algs.model.kdtree.CounterKDTree
Retrieve the counter value.
getEdges() - Method in class algs.model.network.DisjointPairs
Return an array-based implementation of FlowNetwork based upon information contained within the bipartite graph.
getEdgeStructure() - Method in class algs.model.network.FlowNetwork
Subclasses are responsible for interpreting the info in the appropriate data structure.
getEdgeStructure() - Method in class algs.model.network.FlowNetworkAdjacencyList
 
getEdgeStructure() - Method in class algs.model.network.FlowNetworkArray
 
getEdgeStructure() - Method in class algs.model.network.Optimized
Expect this to be unused.
getEnd() - Method in interface algs.model.ILineSegment
Return the coordinate value of the End of the line segment as a two-dimensional IPoint.
getEnd() - Method in class algs.model.twod.TwoDLineSegment
 
getEndPoint() - Method in interface algs.model.IMultiLineSegment
Return the coordinate value of the End of the line segment as an IMultiPoint.
getEndPoint() - Method in class algs.model.twod.TwoDLineSegment
 
getEntry(K) - Method in class algs.model.problems.segmentIntersection.AugmentedBalancedTree
Overrides locate by using interior nodes as guides.
getEntry(K) - Method in class algs.model.tree.BalancedTree
Returns this map's entry for the given key, or null if the map does not contain an entry for the key.
getFlow() - Method in class algs.model.network.EdgeInfo
Return the flow computed by the algorithm.
getFlow() - Method in class algs.model.network.FlowNetwork
After the termination of the network flow algorithm, this method returns the final flow pushed out of the source.
getFlow() - Method in class algs.model.network.FlowNetworkAdjacencyList
 
getFlow() - Method in class algs.model.network.FlowNetworkArray
 
getFlow() - Method in class algs.model.network.Optimized
 
getInputString() - Method in class algs.debug.DottyDebugger
Resulting string available after calling complete.
getKey(IGraphEntity) - Method in class algs.debug.DottyDebugger
Helper function to reverse locate the key.
getKey(IGraphEntity) - Method in class algs.model.problems.tictactoe.debug.TicTacToeDebugger
Helper function to reverse locate the key.
getLeft(int) - Method in interface algs.model.IHypercube
return the coordinate value for the left-side of the given dimension.
getLeft() - Method in interface algs.model.IInterval
Return left index.
getLeft() - Method in class algs.model.interval.DiscreteInterval
Return the left value of the interval.
getLeft() - Method in class algs.model.interval.SegmentTreeNode
Return the left value for this node.
getLeft() - Method in interface algs.model.IRectangle
return the x-coordinate value for the left-side.
getLeft(int) - Method in class algs.model.nd.Hypercube
Return the left-coordinate in the given dimension.
getLeft() - Method in class algs.model.twod.TwoDRectangle
Return left of rectangle.
getLeftSon() - Method in interface algs.model.IBinaryTreeNode
Return the left son associated with this node.
getLeftSon() - Method in class algs.model.interval.SegmentTreeNode
Return the left child.
getLeftSon() - Method in class algs.model.tree.BinaryNode
 
getLeftSon() - Method in class algs.model.tree.RightThreadedBinaryNode
 
getMark() - Method in class algs.model.problems.tictactoe.model.Player
Return the mark for the player.
getMinCut() - Method in class algs.model.network.FlowNetwork
After the termination of the network flow algorithms, the last round of labeled vertices (including the source) can be grouped into a set X while the unlabeled vertices are grouped into X'.
getMinCut() - Method in class algs.model.network.FlowNetworkAdjacencyList
 
getMinCut() - Method in class algs.model.network.FlowNetworkArray
 
getMinCut() - Method in class algs.model.network.Optimized
 
getMinCut() - Method in class algs.model.network.OptimizedFlowNetwork
 
getNext() - Method in class algs.model.tree.RightThreadedBinaryNode
Returns the next node in the tree via the thread (or null).
getNode(int) - Method in class algs.model.interval.SegmentTreeNode
Return smallest granularity node for the given [left,left+1)
getNumDoubleRecursion() - Method in class algs.model.kdtree.KDTree
 
getNumRecursion() - Method in class algs.model.kdtree.KDTree
 
getOpponentMark() - Method in class algs.model.problems.tictactoe.model.Player
Return opponent mark.
getOrigin() - Method in interface algs.model.ICircle
Return origin as an IPoint.
getOrigin() - Method in class algs.model.twod.TwoDCircle
 
getPlayer() - Method in class algs.model.problems.tictactoe.model.PlaceMark
Return the player for this move.
getPoints() - Method in class algs.model.problems.convexhull.PartialHull
Return the points in this Partial Hull.
getPrecedingEntry(K) - Method in class algs.model.tree.BalancedTree
Returns the entry for the greatest key less than the specified key; if no such entry exists (i.e., the least key in the Tree is greater than the specified key), returns null.
getRadius() - Method in interface algs.model.ICircle
return the radius of the circle.
getRadius() - Method in class algs.model.twod.TwoDCircle
 
getRegion() - Method in class algs.model.kdtree.TwoDNode
Return region associated with this node.
getRight(int) - Method in interface algs.model.IHypercube
return the coordinate value for the right-side of the given dimension.
getRight() - Method in interface algs.model.IInterval
Return right index.
getRight() - Method in class algs.model.interval.DiscreteInterval
Return the right value of the interval.
getRight() - Method in class algs.model.interval.SegmentTreeNode
Return the right value for this node.
getRight() - Method in interface algs.model.IRectangle
return the x-coordinate value for the right-side.
getRight(int) - Method in class algs.model.nd.Hypercube
Return the right-coordinate in the given dimension.
getRight() - Method in class algs.model.twod.TwoDRectangle
Return right of rectangle.
getRightSon() - Method in interface algs.model.IBinaryTreeNode
Return the right son associated with this node.
getRightSon() - Method in class algs.model.interval.SegmentTreeNode
Return the right child.
getRightSon() - Method in class algs.model.tree.BinaryNode
 
getRightSon() - Method in class algs.model.tree.RightThreadedBinaryNode
 
getRoot() - Method in class algs.model.interval.SegmentTree
Return the root of the tree.
getRoot() - Method in class algs.model.kdtree.KDTree
Return the root of the KDTree.
getRoot() - Method in class algs.model.kdtree.TwoDTree
Return the root of the TwoDTree, which is guaranteed to be a Vertical Node.
getRoot() - Method in class algs.model.tree.BinaryTree
Expose the root of the tree.
getRoot() - Method in class algs.model.tree.RightThreadedBinaryTree
Return the root of the tree.
getRow() - Method in class algs.model.problems.tictactoe.model.PlaceMark
Return the row for this move.
getRow(long) - Method in class algs.model.tests.common.TrialSuite
Return a single row, if it exists in the table.
getSink() - Method in class algs.model.network.OptimizedFlowNetwork
 
getSource() - Method in class algs.model.network.OptimizedFlowNetwork
 
getStart() - Method in interface algs.model.ILineSegment
Return the coordinate value of the Start of the line segment as a two-dimensional IPoint.
getStart() - Method in class algs.model.twod.TwoDLineSegment
 
getStartPoint() - Method in interface algs.model.IMultiLineSegment
Return the coordinate value of the Start of the line segment as an IMultiPoint.
getStartPoint() - Method in class algs.model.twod.TwoDLineSegment
 
getSuccessorEntry(K) - Method in class algs.model.tree.BalancedTree
Returns the entry for the smallest key greater than the specified key; if no such entry exists (i.e., the least key in the Tree is greater than the specified key), returns null.
getSweepPoint() - Method in class algs.model.problems.segmentIntersection.LineState
Retrieve sweep point.
getTop() - Method in interface algs.model.IRectangle
return the y-coordinate value for the top.
getTop() - Method in class algs.model.twod.TwoDRectangle
Return top of rectangle.
getValue() - Method in class algs.model.tree.BinaryNode
Return the value for this node.
getX() - Method in interface algs.model.ICircle
Return the x-coordinate value of the circle origin.
getX() - Method in interface algs.model.IPoint
return the x-coordinate value for the given point.
getX() - Method in class algs.model.twod.TwoDCircle
 
getX() - Method in class algs.model.twod.TwoDPoint
 
getY() - Method in interface algs.model.ICircle
Return the y-coordinate value of the circle origin.
getY() - Method in interface algs.model.IPoint
return the y-coordinate value for the given point.
getY() - Method in class algs.model.twod.TwoDCircle
 
getY() - Method in class algs.model.twod.TwoDPoint
 
goal - Variable in class algs.debug.DottyDebugger
Goal key.
goal - Variable in class algs.model.searchtree.Solution
Goal node.
GoalNodeDrawer - Class in algs.debug.drawers
Capable of drawing the goal node in the DOTTY debugging output.
GoalNodeDrawer() - Constructor for class algs.debug.drawers.GoalNodeDrawer
 
GoodEvaluator - Class in algs.model.problems.eightpuzzle
Better evaluation function, as drawn from Nilsson, p.
GoodEvaluator() - Constructor for class algs.model.problems.eightpuzzle.GoodEvaluator
 
GoodEvaluator - Class in algs.model.problems.fifteenpuzzle
Better evaluation function, as inspired from Nilsson, p.
GoodEvaluator() - Constructor for class algs.model.problems.fifteenpuzzle.GoodEvaluator
 
greater(double, double) - Static method in class algs.model.FloatingPoint
Given closeness-to-epsilon, is x > y?
greaterEquals(double, double) - Static method in class algs.model.FloatingPoint
Given closeness-to-epsilon, is x >= y?
GridGenerator - Class in algs.model.data.segments
Generators of grid lines for O(sqrt(n)) number of intersections given n lines.
GridGenerator(double, double) - Constructor for class algs.model.data.segments.GridGenerator
Maximum height of the ladder.

H

hash(V) - Method in interface algs.model.search.IHash
Compute the proper index into a hashtable.
hash(String) - Method in class algs.model.search.SimpleHash
 
hash(V) - Method in class algs.model.search.StandardHash
 
HASH - Static variable in class algs.model.searchtree.states.StateStorageFactory
Use hash table to maintain set.
hashCode() - Method in class algs.model.interval.DiscreteInterval
Returns the hashCode for this DiscreteInterval.
hashCode() - Method in class algs.model.nd.Hypercube
Meaningful hashcode function.
hashCode() - Method in class algs.model.nd.Hyperpoint
Reasonable hash code.
hashCode() - Method in class algs.model.network.EdgeInfo
Support hashCode protocol.
hashCode() - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Define the hashcode to be based on the key()
hashCode() - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Define the hashcode to be based on the key()
hashCode() - Method in class algs.model.problems.tictactoe.model.Cell
Hashcode must be implemented if this cell is to be used in a Hashtable.
hashCode() - Method in class algs.model.problems.tictactoe.model.Move
Ensure that we can use Move objects within hashtables by simplying calculating hashCode values based upon toString() for the Move subclasses.
hashCode() - Method in class algs.model.problems.tictactoe.model.Player
Enable Player objects to be used in hash table.
hashCode() - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
To enable this board to be a key in a Hashtable.
hashCode() - Method in class algs.model.twod.TwoDCircle
Hashcode.
hashCode() - Method in class algs.model.twod.TwoDPoint
 
HashTable<K,V> - Class in algs.model.search
Provides the abstract base class for hash tables.
HashTable(int, IHash<K>) - Constructor for class algs.model.search.HashTable
Construct an empty HashTable of the given size.
hasNext() - Method in class algs.model.list.DoubleLinkedListIterator
Determine if more elements exist in iteration.
hasNext() - Method in class algs.model.list.ListIterator
Determine if there are more Nodes in the list to be reported.
hasNext() - Method in class algs.model.search.StringFileIterator
 
hasNext() - Method in class algs.model.tree.AbstractBinaryTraversal
Determines if there are more steps in the traversal.
hasNext() - Method in class algs.model.tree.ValueExtractor
Delegate request to the internal iterator.
hasThree() - Method in class algs.model.problems.convexhull.andrew.PartialLinkedListHull
Determine if there are more than 2 points currently in the partial hull.
hasThree() - Method in class algs.model.problems.convexhull.PartialHull
Determine if there are more than 2 points currently in the partial hull.
head() - Method in class algs.model.list.List
Return head of the list.
HeapAndrew - Class in algs.model.problems.convexhull.heap
Computes Convex Hull following Andrew's Algorithm.
HeapAndrew() - Constructor for class algs.model.problems.convexhull.heap.HeapAndrew
 
HeapSort<E> - Class in algs.model.heap
Implementation of HeapSort using BinaryHeap.
HeapSort() - Constructor for class algs.model.heap.HeapSort
 
height() - Method in class algs.model.kdtree.KDTree
Helper method for testing.
histogram() - Method in class algs.model.tests.common.TrialSuite
 
HorizontalLineGenerator - Class in algs.model.data.points
Generate a set of points that all exist on a horizontal line.
HorizontalLineGenerator(double) - Constructor for class algs.model.data.points.HorizontalLineGenerator
 
HorizontalNode - Class in algs.model.kdtree
Represents a node in the KD-tree that partitions the space by means of a vertical line at the given y-coordinate.
HorizontalNode(IPoint) - Constructor for class algs.model.kdtree.HorizontalNode
Y-coordinate is taken from the point.
HubGenerator - Class in algs.model.data.segments
Generators of sample lines that form a hub-and-spoke.
HubGenerator(double, double, double) - Constructor for class algs.model.data.segments.HubGenerator
Hub needs its length, x- and y-coordinate
Hypercube - Class in algs.model.nd
Represents a Hypercube in the n-dimensional Cartesian plane.
Hypercube(int) - Constructor for class algs.model.nd.Hypercube
Construct an n-dimensional hypercube with origin coordinates.
Hypercube(IHypercube) - Constructor for class algs.model.nd.Hypercube
Fill in values for this hypercube drawn from the IHypercube parameter.
Hypercube(double[], double[]) - Constructor for class algs.model.nd.Hypercube
Construct an n-dimensional hypercube.
Hypercube(double, double, double, double) - Constructor for class algs.model.nd.Hypercube
Convenience method to construct a 2-dimensional Hypercube from two points.
Hyperpoint - Class in algs.model.nd
Standard d-dimensional implementation of IMultiPoint.
Hyperpoint(IMultiPoint) - Constructor for class algs.model.nd.Hyperpoint
Construct when given an IMultiPoint.
Hyperpoint(double[]) - Constructor for class algs.model.nd.Hyperpoint
Construct when given a raw array of double values
Hyperpoint(String) - Constructor for class algs.model.nd.Hyperpoint
Construct Hyperpoint when given a comma-separated string of doubles.

I

IBalancedVisitor<K,V> - Interface in algs.model.tree
Visitor of nodes within the balanced binary tree.
IBinaryTreeNode<T> - Interface in algs.model
Base structure for a BinaryTree ensures there is a typed left and right child.
ICircle - Interface in algs.model
A circle point has an IPoint origin and a radius >= 0.
IComparator - Interface in algs.model.gametree
Defines a comparator function for scores on a gameTree board.
IConstructor - Interface in algs.model.interval
Interface for constructing nodes in a Segment Tree.
IConvexHull - Interface in algs.model.problems.convexhull
Defined interface for algorithms that compute the convex hull for a set of IPoint objects.
IDebugSearch - Interface in algs.debug
Used by animation and other purposes to track the status of a Search.
IEvaluation - Interface in algs.model.gametree
Common interface for game Tree algorithms seeking the best move given a particular game state and player making its move.
IGameMove - Interface in algs.model.gametree
A valid move in the GameTree.
IGameScore - Interface in algs.model.gametree
Each game state position requires some scoring function.
IGameState - Interface in algs.model.gametree
A valid representation of the state of a particular game with two players.
IGraphEntity - Interface in algs.debug
All graphical state drawing depends on the individual nodes to be able to return a labeled string to represent itself.
IGraphEntity.Formatter - Class in algs.debug
Useful Format for special characters.
IGraphEntity.Formatter() - Constructor for class algs.debug.IGraphEntity.Formatter
 
IHash<V> - Interface in algs.model.search
Default interface for producing the slot within the hashtable for an element.
IHashtableAccess<K,V> - Interface in algs.model.search
Abstraction of methods that one expects a Hashtable to perform.
IHypercube - Interface in algs.model
Represents a hypercube in the n-dimensional Cartesian plane.
IInterval - Interface in algs.model
A segment has a left and a right index and is understood to represent a semi-closed range [left, right).
ILineSegment - Interface in algs.model
A Line Segment between two-dimensional points.
IMove - Interface in algs.model.searchtree
A valid move in the Search Tree.
IMultiLineSegment - Interface in algs.model
A Line Segment between two multidimensional points.
IMultiPoint - Interface in algs.model
A multi-dimensional point has a set of coordinates in d-dimensional space.
inAboveRange(IRectangle) - Method in class algs.model.kdtree.HorizontalNode
 
inAboveRange(IRectangle) - Method in class algs.model.kdtree.TwoDNode
Helper method for search algorithm, implemented in the Horizontal and Vertical subclasses.
inAboveRange(IRectangle) - Method in class algs.model.kdtree.VerticalNode
 
inBelowRange(IRectangle) - Method in class algs.model.kdtree.HorizontalNode
 
inBelowRange(IRectangle) - Method in class algs.model.kdtree.TwoDNode
Helper method for search algorithm, implemented in the Horizontal and Vertical subclasses.
inBelowRange(IRectangle) - Method in class algs.model.kdtree.VerticalNode
 
incrementCounter() - Method in interface algs.model.gametree.IGameState
Debugging interface for incrementing count of games.
incrementCounter() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
 
initial - Variable in class algs.model.searchtree.Solution
Initial node.
initialCapacity - Static variable in class algs.model.searchtree.states.StateHash
Initial capacity.
initialize() - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
Initialize algorithm.
initialize() - Method in class algs.model.problems.segmentIntersection.LineSweep
 
initialize() - Method in class algs.model.problems.segmentIntersection.linkedlist.LineSweep
Initialize algorithm.
initialize() - Method in class algs.model.problems.segmentIntersection.priorityqueue.SlowLineSweep
Initialize algorithm.
initializeState(TicTacToeState) - Method in class algs.model.problems.tictactoe.model.Logic
Enable variations to instantiate the stored data with each game state.
InitialNodeDrawer - Class in algs.debug.drawers
Capable of drawing the initial node in the DOTTY debugging output.
InitialNodeDrawer() - Constructor for class algs.debug.drawers.InitialNodeDrawer
 
initialPhase() - Method in class algs.model.tree.AbstractBinaryTraversal
Return the initial phase of the traversal.
initialPhase() - Method in class algs.model.tree.InorderTraversal
Initial phase for inorder traversal is LEFT.
initialPhase() - Method in class algs.model.tree.PostorderTraversal
Initial phase for postorder traversal is LEFT.
initialPhase() - Method in class algs.model.tree.PreorderTraversal
Initial phase for preorder traversal is SELF.
initialValue() - Method in interface algs.model.gametree.IComparator
Defines the initial value to use when iterating over a set of scores (using the comparator).
INode - Interface in algs.model.searchtree
A valid representation of the node within a search tree.
INodeDrawer - Interface in algs.debug
Interface to define functionality for drawing nodes in Dotty format.
INodeSet - Interface in algs.model.searchtree
Defines an interface by which sets of INode objects are accessed.
inorder() - Method in class algs.model.tree.BinaryTree
Use in-order traversal over the tree.
inorder() - Method in class algs.model.tree.RightThreadedBinaryTree
Use in-order traversal over the tree.
InorderTraversal<T extends IBinaryTreeNode> - Class in algs.model.tree
Perform an inorder traversal of the tree.
InorderTraversal(T) - Constructor for class algs.model.tree.InorderTraversal
Start at the given node.
insert(int, Comparable<E>) - Method in class algs.model.heap.BinaryHeap
Insert the element (id) with given priority.
insert(E) - Method in class algs.model.heap.ExternalBinaryHeap
 
insert(IInterval) - Method in class algs.model.interval.SegmentTreeNode
Insert the given segment into the SegmentTree.
insert(IMultiPoint) - Method in class algs.model.kdtree.KDTree
Insert the value into its proper location.
insert(IPoint) - Method in class algs.model.kdtree.TwoDTree
Insert the value into its proper location.
insert(E) - Method in class algs.model.list.DoubleLinkedList
Insert an entity based upon the comparator.
insert(K) - Method in class algs.model.problems.segmentIntersection.AugmentedBalancedTree
Must make sure that interior nodes contain no segments; rather, only the leaves do.
insert(EventPoint) - Method in class algs.model.problems.segmentIntersection.EventQueue
Insert the Event Point into the queue, taking care to properly maintain the set of segments associated with this EventPoint if it is indeed has upper Segments.
insert(EventPoint) - Method in class algs.model.problems.segmentIntersection.priorityqueue.SlowEventQueue
Insert the Event Point into the queue, taking care to properly maintain the set of segments associated with this EventPoint if it is indeed has upper Segments.
insert(INode) - Method in class algs.model.searchtree.ClosedStates
Insert the board state into the openStates.
insert(INode) - Method in interface algs.model.searchtree.INodeSet
Inserts node based on inherent behavior.
insert(INode) - Method in class algs.model.searchtree.states.StateHash
Insert a node into the hash.
insert(INode) - Method in class algs.model.searchtree.states.StateOrdered
Insert the board state into the set.
insert(INode) - Method in class algs.model.searchtree.states.StateQueue
Insert node places at end of queue.
insert(INode) - Method in class algs.model.searchtree.states.StateStack
Insert pushes the element onto the stack.
insert(INode) - Method in class algs.model.searchtree.states.StateTree
Insert the board state into the tree.
insert(K, V) - Method in class algs.model.tree.BalancedTree
Associates the specified value with the specified key in this map.
insert(T) - Method in class algs.model.tree.BinaryTree
Insert the value into its proper location in the Binary tree.
insert(T) - Method in class algs.model.tree.RightThreadedBinaryTree
Insert the value into its proper location in the Binary tree.
insertSegments(List<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.LineState
Insert the segments into the line state.
insertSegments(List<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.linkedlist.LinkedListLineState
insert the set of line segments into the state at their proper location based upon the sort order.
IntegerGenerator - Class in algs.model.data.segments
Generators of sample lines using integer coordinated within the [max, max] box whose segment distance is length.
IntegerGenerator(int, int) - Constructor for class algs.model.data.segments.IntegerGenerator
Prepare generator with boundaries of the square together with the desired length of line segments to create.
IntelligentAgent - Class in algs.model.problems.tictactoe.model
Represents an Intelligent Tic Tac Toe playing agent that relies on the provided algorithm to select a move.
IntelligentAgent(char, IEvaluation) - Constructor for class algs.model.problems.tictactoe.model.IntelligentAgent
Construct an agent that selects the next move using the provided logic in the algorithm.
internalPoint(IPoint[], int, int, int, int) - Static method in class algs.model.problems.convexhull.slowhull.SlowHull
Determine if points[m] is inside triangle formed by Given line (i,j), determine which side points[m] is on.
interpretMove(IGameState, int, int, Player) - Method in class algs.model.problems.tictactoe.model.Logic
Method to determine the type of move that the user has selected.
interpretMove(IGameState, int, int, Player) - Method in class algs.model.problems.tictactoe.model.StraightLogic
Method to determine the type of move that the user has selected.
INTERSECTING - Static variable in interface algs.model.ILineSegment
 
intersectingSegments() - Method in class algs.model.problems.segmentIntersection.EventPoint
Return the set of Line segments that intersect this eventPoint.
intersection(ILineSegment) - Method in interface algs.model.ILineSegment
Return the intersection point with the given Line Segment, or null if no such intersection.
intersection(IPoint) - Method in interface algs.model.ILineSegment
Determine if Line Segment intersects the given point.
intersection(ILineSegment) - Method in class algs.model.twod.TwoDLineSegment
Computer the intersection point with the given line segment.
intersection(IPoint) - Method in class algs.model.twod.TwoDLineSegment
Determine if line segments intersects this point.
IntersectionDetection - Class in algs.model.problems.segmentIntersection
This superclass has been designed to enable the side-by-side comparison of a number of line segment variations, where different data structures are used to support the core algorithm.
IntersectionDetection() - Constructor for class algs.model.problems.segmentIntersection.IntersectionDetection
 
intersections(ILineSegment[]) - Method in class algs.model.problems.segmentIntersection.BruteForceAlgorithm
Check each possible pair of line segments and record its intersection.
intersections(ILineSegment[]) - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
The subclass determines all intersections.
intersections(Collection<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
Compute the intersection of all segments when given a Collection of segments.
intersections(Iterator<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
Compute the intersection of all segments when given an Iterator of segments.
intersections(ILineSegment[]) - Method in class algs.model.problems.segmentIntersection.LineSweep
Compute the intersection of all segments when given an array of segments.
intersections(ILineSegment[]) - Method in class algs.model.problems.segmentIntersection.linkedlist.LineSweep
Compute the intersection of all segments when given an array of segments.
intersections(ILineSegment[]) - Method in class algs.model.problems.segmentIntersection.priorityqueue.SlowLineSweep
Compute the intersection of all segments when given an array of segments.
intersectionType(ILineSegment) - Method in class algs.model.twod.TwoDLineSegment
Compute the intersection type with the given line segment.
intersects(IMultiPoint) - Method in interface algs.model.IHypercube
Determine if the given point intersects the hypercube.
intersects(double[]) - Method in interface algs.model.IHypercube
Optimized version of IHypercube.intersects(IMultiPoint).
intersects(IHypercube) - Method in interface algs.model.IHypercube
Determine if the hypercube intersects the given hypercube h.
intersects(int) - Method in interface algs.model.IInterval
Determines if the q value is greater than or equal to getLeft() and strictly less than getRight()
intersects(int) - Method in class algs.model.interval.DiscreteInterval
 
intersects(int) - Method in class algs.model.interval.SegmentTreeNode
 
intersects(IPoint) - Method in interface algs.model.IRectangle
Determine if the given point intersects the rectangle.
intersects(double[]) - Method in class algs.model.nd.Hypercube
Determine intersection among all point coordinates (in raw, optimized form).
intersects(IMultiPoint) - Method in class algs.model.nd.Hypercube
Determine intersection among all point coordinates.
intersects(IHypercube) - Method in class algs.model.nd.Hypercube
Determine if the hypercube intersects the given hypercube h.
intersects(IPoint) - Method in class algs.model.twod.TwoDRectangle
Determines intersection of the given point within the closed Rectangular region.
intervals - Variable in class algs.model.interval.StoredIntervalsNode
Store Interval.
intervals() - Method in class algs.model.interval.StoredIntervalsNode
Return all IInterval objects for this node as a collection.
IPivotIndex - Interface in algs.model.array
Interface describing behavior for selecting a pivotIndex for partition.
IPlayer - Interface in algs.model.gametree
A Player of the game.
IPoint - Interface in algs.model
A point has an x- and y-coordinate over the cartesian plane.
IRectangle - Interface in algs.model
Represents a rectangle in the Cartesian plane.
isAdjacent(Cell) - Method in class algs.model.problems.tictactoe.model.Cell
Determines if this is adjacent to the given cell either horizontally or vertically.
isAdjacentAndEmpty(int, int, int, int) - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Ensure that the empty square is in [toR][toC] and that [fromR][fromC] is adjacent horizontally or vertical.
isAdjacentAndEmpty(int, int, int, int) - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Ensure that the empty square is in [toR][toC] and that [fromR][fromC] is adjacent horizontally or vertical.
isBelow(IMultiPoint) - Method in class algs.model.kdtree.DimensionalNode
Returns whether the point is below the line represented by this node.
isBelow(IPoint) - Method in class algs.model.kdtree.HorizontalNode
 
isBelow(IPoint) - Method in class algs.model.kdtree.TwoDNode
Returns whether the point is below the line represented by this node.
isBelow(IPoint) - Method in class algs.model.kdtree.VerticalNode
 
isBoundless() - Method in class algs.model.kdtree.DimensionalNode
Determine if node has a boundless region associated with it.
isClear(int, int) - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Determines if cell is empty.
isClear() - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Return true if entire board is empty.
IScore - Interface in algs.model.searchtree
The scoring function returns an int value given a board state.
isDraw() - Method in interface algs.model.gametree.IGameState
Determine if this game state is a draw.
isDraw() - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Determine if a game is a draw because all cells are occupied but the game is not won.
isDraw() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
 
ISearch - Interface in algs.model.searchtree
Common interface for all search algorithms over a search tree.
ISelectFont - Interface in algs.debug
Should a graphical entity choose to select a different font for its node drawing (for example, to show symbols) then it must implement this interface.
isEmpty() - Method in class algs.model.heap.BinaryHeap
Determines if Binary Heap is empty.
isEmpty() - Method in class algs.model.heap.ExternalBinaryHeap
Determine if Binary Heap is empty.
isEmpty() - Method in class algs.model.list.DoubleLinkedList
Return whether the list is empty.
isEmpty() - Method in class algs.model.list.List
Return whether the list is empty.
isEmpty(int, int) - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Determine is the given (r,c) in the board is empty.
isEmpty(int, int) - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
 
isEmpty() - Method in class algs.model.problems.segmentIntersection.EventQueue
Return whether the event queue is empty.
isEmpty() - Method in class algs.model.problems.segmentIntersection.priorityqueue.SlowEventQueue
Return whether the event queue is empty.
isEmpty() - Method in class algs.model.searchtree.ClosedStates
Determine if open states is empty.
isEmpty() - Method in interface algs.model.searchtree.INodeSet
Is collection empty.
isEmpty() - Method in class algs.model.searchtree.states.StateHash
 
isEmpty() - Method in class algs.model.searchtree.states.StateOrdered
 
isEmpty() - Method in class algs.model.searchtree.states.StateQueue
 
isEmpty() - Method in class algs.model.searchtree.states.StateStack
Is stack empty?
isEmpty() - Method in class algs.model.searchtree.states.StateTree
 
isHorizontal() - Method in interface algs.model.ILineSegment
Determine if horizontal line.
isHorizontal() - Method in class algs.model.twod.TwoDLineSegment
Determine if horizontal.
isLeaf() - Method in class algs.model.kdtree.DimensionalNode
Determines if node is a leaf node (i.e., has no children).
isPoint() - Method in interface algs.model.ILineSegment
Determine if this line segment is simply a point (same start & end).
isPoint - Variable in class algs.model.twod.TwoDLineSegment
Is just a point?
isPoint() - Method in class algs.model.twod.TwoDLineSegment
 
isSymbol(int) - Static method in class algs.debug.IGraphEntity.Formatter
Helper method to determine if special font is needed.
isThread() - Method in class algs.model.tree.RightThreadedBinaryNode
Determines if this node is indeed maintaining a forward-pointer to the next in tree.
isValid(IGameState) - Method in interface algs.model.gametree.IGameMove
Determine if move is valid in the game state.
isValid(INode) - Method in class algs.model.problems.eightpuzzle.SlideMove
Determine if move is valid for the given state.
isValid(INode) - Method in class algs.model.problems.fifteenpuzzle.SlideMove
Determine if move is valid for the given state.
isValid(IGameState) - Method in class algs.model.problems.tictactoe.model.Move
Determines if move can be made on the given TicTacToe Board.
isValid(IGameState) - Method in class algs.model.problems.tictactoe.model.PlaceMark
Determines if move is valid.
isValid(INode) - Method in interface algs.model.searchtree.IMove
Determine if move is valid in the board state.
isVertical() - Method in interface algs.model.ILineSegment
Determine if vertical line.
isVertical() - Method in class algs.model.kdtree.HorizontalNode
 
isVertical() - Method in class algs.model.kdtree.TwoDNode
Determines whether node splits plane vertically
isVertical() - Method in class algs.model.kdtree.VerticalNode
 
isVertical() - Method in class algs.model.twod.TwoDLineSegment
Determine if vertical.
isWin() - Method in interface algs.model.gametree.IGameState
Determine if this game state has a winner.
isWin() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
 
iterator() - Method in class algs.model.interval.SegmentTree
Use in-order traversal over the tree.
iterator() - Method in class algs.model.list.DoubleLinkedList
Return iterator to elements in the list.
iterator() - Method in class algs.model.list.List
Return iterator over the list.
iterator() - Method in class algs.model.searchtree.ClosedStates
Expose iterator to internal board states.
iterator() - Method in interface algs.model.searchtree.INodeSet
Return iterator to the existing board states.
iterator() - Method in class algs.model.searchtree.states.StateHash
 
iterator() - Method in class algs.model.searchtree.states.StateOrdered
 
iterator() - Method in class algs.model.searchtree.states.StateQueue
 
iterator() - Method in class algs.model.searchtree.states.StateStack
Expose iterator to internal board states.
iterator() - Method in class algs.model.searchtree.states.StateTree
 
iterator() - Method in class algs.model.tree.BalancedTree
 
iterator() - Method in class algs.model.tree.BinaryTree
Provide useful in-order iteration over the values of the Binary Tree.
iterator() - Method in class algs.model.tree.RightThreadedBinaryTree
Provide useful in-order iteration over the values of the Binary Tree.
IVisitKDNode - Interface in algs.model.kdtree
Provides interface to enable traversals over KD trees to be defined.
IVisitor<T extends java.lang.Comparable<T>> - Interface in algs.model.tree
Visitor of nodes.
IVisitTwoDNode - Interface in algs.model.kdtree
Provides interface to enable traversals over TwoD trees to be defined.

K

KDFactory - Class in algs.model.kdtree
Produces a KD-tree from a given input set using recursive median approach.
KDFactory() - Constructor for class algs.model.kdtree.KDFactory
 
KDTraversal - Class in algs.model.kdtree
Defines a standard inorder traversal of the KDTree and enables subclasses to provide specialized method to take action at each node of the tree.
KDTraversal() - Constructor for class algs.model.kdtree.KDTraversal
Default constructor to properly enable subclasses to work.
KDTraversal(KDTree) - Constructor for class algs.model.kdtree.KDTraversal
Start traversal at the root.
KDTraversal(KDTree, DimensionalNode) - Constructor for class algs.model.kdtree.KDTraversal
Start traversal at the given node within the tree rooted at tree
KDTree - Class in algs.model.kdtree
Standard unbalanced k-dimensional binary tree.
KDTree(int) - Constructor for class algs.model.kdtree.KDTree
Default KDTree constructor.
key() - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Return key that satisfies rotational symmetry.
key() - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Return key that satisfies rotational symmetry.
key() - Method in interface algs.model.searchtree.INode
Computes to a key value such that if two board states have the exact same key, then the board states are equivalent.
key() - Method in class algs.model.tree.BalancedBinaryNode
Return the key for this node.
keys() - Method in class algs.model.tests.common.TrialSuite
Expose the set of keys maintained by the table.

L

labelEdge(IGraphEntity, IGraphEntity, String) - Method in class algs.debug.DottyDebugger
Label edge with information.
last() - Method in class algs.model.list.DoubleLinkedList
Return last element in list.
lastNode() - Method in class algs.model.tree.BalancedTree
Returns the last Entry in the tree.
LastSelector - Class in algs.model.array
Quicksort selector during partition that selects rightmost element.
LastSelector() - Constructor for class algs.model.array.LastSelector
 
left() - Method in class algs.model.problems.segmentIntersection.AugmentedNode
 
left - Variable in class algs.model.tree.BalancedBinaryNode
Left son.
left() - Method in class algs.model.tree.BalancedBinaryNode
Return left son.
left(BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedBinaryNode
Set the left child.
leftNeighbor(EventPoint) - Method in class algs.model.problems.segmentIntersection.LineState
Find node within the state that is the closest neighbor (on the left) to the given event point.
leftNeighbor(EventPoint) - Method in class algs.model.problems.segmentIntersection.linkedlist.LinkedListLineState
 
Legend - Class in algs.debug
Key information about a drawn graph can be represented as a graph legend.
Legend(String) - Constructor for class algs.debug.Legend
Construct the legend contents from a String.
length - Variable in class algs.model.data.segments.DoubleGenerator
The size of each line segment.
lesser(double, double) - Static method in class algs.model.FloatingPoint
Given closeness-to-epsilon, is x < y?
lesserEquals(double, double) - Static method in class algs.model.FloatingPoint
Given closeness-to-epsilon, is x <= y?
LineState - Class in algs.model.problems.segmentIntersection
Manages the state of segments in a balanced binary tree whose leaf nodes are used to store segments while the interior nodes are used to guide searches and insertions to the appropriate leaf nodes.
LineState() - Constructor for class algs.model.problems.segmentIntersection.LineState
 
LineSweep - Class in algs.model.problems.segmentIntersection
Contains LineSweep algorithm to detect all intersections among an array of line segments.
LineSweep() - Constructor for class algs.model.problems.segmentIntersection.LineSweep
 
LineSweep - Class in algs.model.problems.segmentIntersection.linkedlist
Implementation using linkedList for lineState to show performance degradation as the size of the state increases.
LineSweep() - Constructor for class algs.model.problems.segmentIntersection.linkedlist.LineSweep
Construct a sweep object.
LinkedListLineState - Class in algs.model.problems.segmentIntersection.linkedlist
Class that shows the performance degradation when the line state is stored using a linked list instead of an augmented, balanced binary tree.
LinkedListLineState() - Constructor for class algs.model.problems.segmentIntersection.linkedlist.LinkedListLineState
 
List<E> - Class in algs.model.list
List of objects.
List() - Constructor for class algs.model.list.List
Construct an empty list.
ListHashTable<V> - Class in algs.model.search
HashTable that uses list collision to store objects whose keys collide.
ListHashTable(int, IHash<V>) - Constructor for class algs.model.search.ListHashTable
Construct initial Hash Table using desired hash method.
ListHashTable(int) - Constructor for class algs.model.search.ListHashTable
Construct initial Hash Table using default hash method that relies on a properly formed hashCode() implementation.
ListHashTableReporter<V> - Class in algs.model.search
Generate useful statistics about ListHashTable object.
ListHashTableReporter(ListHashTable<V>) - Constructor for class algs.model.search.ListHashTableReporter
Load up the HashTable for this reporter.
ListIterator<E> - Class in algs.model.list
Provide minimal iterator to walk through the next pointers in the linked list.
ListIterator(List<E>) - Constructor for class algs.model.list.ListIterator
Constructor for iterator takes the list as parameter.
load(Iterator<V>) - Method in class algs.model.search.ListHashTable
Bulk load elements into the Hash Table from the Iterator.
LoadFromFileGenerator - Class in algs.model.data.points
Generator of IPoint objects that loads requested points from a designated file (rather then through some computation).
LoadFromFileGenerator(String) - Constructor for class algs.model.data.points.LoadFromFileGenerator
 
LoadFromFileGenerator - Class in algs.model.data.segments
Generator of ILineSegment objects that loads requested points from a designated file (rather then through some computation).
LoadFromFileGenerator(String) - Constructor for class algs.model.data.segments.LoadFromFileGenerator
 
Logic - Class in algs.model.problems.tictactoe.model
Contains logic for a particular TicTacToe Variation about how to interpret the attempt to select a cell (Col, Row) as the desired move.
Logic() - Constructor for class algs.model.problems.tictactoe.model.Logic
 
logic - Variable in class algs.model.problems.tictactoe.model.Player
Logic for game.
logic() - Method in class algs.model.problems.tictactoe.model.Player
Returns logic.
logic(Logic) - Method in class algs.model.problems.tictactoe.model.Player
Set the logic of the game being played.
logic() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
External state may be found in logic.
lowerEndpointSegments() - Method in class algs.model.problems.segmentIntersection.EventPoint
Return the set of Line segments whose lower (i.e., End) endpoint is this EventPoint.

M

m - Variable in class algs.model.network.Transshipment
Number of suppliers.
m - Variable in class algs.model.twod.TwoDLineSegment
Slope.
mark - Variable in class algs.model.problems.tictactoe.model.Player
Knows its character to play.
markDiscarded(IGraphEntity) - Method in class algs.debug.DottyDebugger
 
markDiscarded(IGraphEntity) - Method in interface algs.debug.IDebugSearch
Mark node as being discarded.
markEdge(IGraphEntity, IGraphEntity) - Method in class algs.debug.DottyDebugger
Mark special edges in bold.
markEdge(IGraphEntity, IGraphEntity) - Method in interface algs.debug.IDebugSearch
Mark edge that was part of a solution.
markGoal(IGraphEntity) - Method in class algs.debug.DottyDebugger
Mark the goal node found.
markGoal(IGraphEntity) - Method in interface algs.debug.IDebugSearch
Mark search goal (or null for failed search).
markStart(IGraphEntity) - Method in class algs.debug.DottyDebugger
Mark the start node.
markStart(IGraphEntity) - Method in interface algs.debug.IDebugSearch
Mark search initial location.
markUnexplored(IGraphEntity) - Method in class algs.debug.DottyDebugger
 
markUnexplored(IGraphEntity) - Method in interface algs.debug.IDebugSearch
Mark node as being unexplored.
match - Variable in class algs.model.network.matching.Pair
Matching element from set T.
max(Comparable[]) - Static method in class algs.model.array.Selection
Locate the maximum value from an array of Comparables.
max - Variable in class algs.model.data.segments.DoubleGenerator
Size of the domain for both x- and y- coordinates [0, max].
MAX - Static variable in interface algs.model.gametree.IComparator
MAX comparator takes highest score.
max - Variable in class algs.model.kdtree.DimensionalNode
Maximum dimension.
max - Variable in class algs.model.problems.segmentIntersection.AugmentedNode
Minimum segment to appear in left sub-tree.
MaxC - Static variable in class algs.model.problems.eightpuzzle.EightPuzzleNode
Max constant for number of columns.
MaxC - Static variable in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
 
MaxC - Static variable in class algs.model.problems.tictactoe.model.TicTacToeBoard
Max number of columns.
maxDimension - Variable in class algs.model.kdtree.KDTree
Maximum dimension for this tree.
maximum() - Static method in class algs.model.gametree.MoveEvaluation
Return the maximum score, so a move's score can be compared.
maxNumberMoves() - Method in class algs.model.problems.tictactoe.model.Logic
Most TicTacToe variations are guaranteed to have a fixed number of moves before the game is either won, lost, or drawn.
MaxR - Static variable in class algs.model.problems.eightpuzzle.EightPuzzleNode
Max constant for number of rows.
MaxR - Static variable in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Max constants
MaxR - Static variable in class algs.model.problems.tictactoe.model.TicTacToeBoard
Max number of rows.
maxValue - Variable in class algs.model.data.points.UnusualGenerator
Store the max value.
MedianSelector - Class in algs.model.array
Select median of first/middle/last.
MedianSelector() - Constructor for class algs.model.array.MedianSelector
 
member(T) - Method in class algs.model.tree.BinaryTree
Determine if the given value occurs in the tree
member(T) - Method in class algs.model.tree.RightThreadedBinaryTree
Determine if the given value occurs in the tree.
min(Comparable[]) - Static method in class algs.model.array.Selection
Locate the minimum value from an array of Comparable objects.
MIN - Static variable in interface algs.model.gametree.IComparator
MIN comparator takes lowest score.
min - Variable in class algs.model.problems.segmentIntersection.AugmentedNode
Maximum segment to appear in right sub-tree.
min() - Method in class algs.model.problems.segmentIntersection.EventQueue
Remove and return left-most child [the smallest one].
min() - Method in class algs.model.problems.segmentIntersection.priorityqueue.SlowEventQueue
Remove and return left-most child [the smallest one].
MiniMax - Static variable in class algs.model.problems.tictactoe.model.PlayerFactory
Algorithms.
MinimaxEvaluation - Class in algs.model.gametree.debug
Initiate MinimaxEvaluation over the given game state and ply.
MinimaxEvaluation(int) - Constructor for class algs.model.gametree.debug.MinimaxEvaluation
Create an evaluator with the given state.
MinimaxEvaluation - Class in algs.model.gametree
Perform a MiniMax evaluation over a game state to the fixed ply depth.
MinimaxEvaluation(int) - Constructor for class algs.model.gametree.MinimaxEvaluation
Create an evaluator with the given state.
minimum() - Static method in class algs.model.gametree.MoveEvaluation
Return the minimum score, so a move's score can be compared.
minimum() - Method in class algs.model.tree.BalancedTree
Removes and returns minimum value in tree.
MinMaxNode - Class in algs.model.gametree.debug
Represents a Min or Max node in the debugging output.
MinMaxNode(Comparator<Integer>) - Constructor for class algs.model.gametree.debug.MinMaxNode
Construct node based upon its MIN/MAX type.
move - Variable in class algs.model.gametree.MoveEvaluation
The Move.
move - Variable in class algs.model.gametree.Pair
The move evaluation that generated the state.
Move - Class in algs.model.problems.tictactoe.model
Represents a Move on the TicTacToe Board.
Move() - Constructor for class algs.model.problems.tictactoe.model.Move
 
move - Variable in class algs.model.searchtree.Transition
The move which caused the board state transition.
MoveEvaluation - Class in algs.model.gametree
Used to represent the Comparable score for a given Move.
MoveEvaluation() - Constructor for class algs.model.gametree.MoveEvaluation
Constructs empty Move Evaluation with null move and -infinity score.
MoveEvaluation(int) - Constructor for class algs.model.gametree.MoveEvaluation
Constructs the evaluation object representing straight board evaluation.
MoveEvaluation(IGameMove, int) - Constructor for class algs.model.gametree.MoveEvaluation
Constructs the evaluation object.
moves() - Method in class algs.model.searchtree.Solution
Sequence of moves that achieve the goalState.

N

n - Variable in class algs.model.network.Transshipment
Number of demanders.
nearest(double[], double[]) - Method in class algs.model.kdtree.DimensionalNode
In sub-tree rooted at node, see if one of its descendants is closer to rawTarget than min[0].
nearest(IMultiPoint) - Method in class algs.model.kdtree.KDTree
Find the nearest point in the KDtree to the given point.
nearest(IPoint) - Method in class algs.model.kdtree.TwoDTree
Find the nearest point in the TwoDtree to the given point.
nearest(IMultiPoint) - Method in class algs.model.problems.nearestNeighbor.BruteForceNearestNeighbor
Return the closest point to x within the input set P.
negmax(int, IPlayer, IPlayer) - Method in class algs.model.gametree.NegMaxEvaluation
Given the board state, Intelligent player is trying to determine where to make his move.
NegMax - Static variable in class algs.model.problems.tictactoe.model.PlayerFactory
 
NegMaxEvaluation - Class in algs.model.gametree.debug
Represents an Intelligent Tic Tac Toe playing agent that uses the NegMax algorithm to select a move.
NegMaxEvaluation(int) - Constructor for class algs.model.gametree.debug.NegMaxEvaluation
Create an evaluator with the given state.
NegMaxEvaluation - Class in algs.model.gametree
Represents an Intelligent agent that uses the NegMax algorithm to select a move.
NegMaxEvaluation(int) - Constructor for class algs.model.gametree.NegMaxEvaluation
Create an evaluator with the given state.
NegMaxNode - Class in algs.model.gametree.debug
Represents a NegMax node in the debugging output.
NegMaxNode() - Constructor for class algs.model.gametree.debug.NegMaxNode
 
next() - Method in class algs.model.list.DoubleLinkedListIterator
Return next element in the iteration.
next() - Method in class algs.model.list.DoubleNode
Return next.
next(DoubleNode<E>) - Method in class algs.model.list.DoubleNode
Modifies the next link for this node.
next() - Method in class algs.model.list.ListIterator
Return the value of the next node in the list and advances the Iterator.
next() - Method in class algs.model.list.Node
Return the next one in the list.
next() - Method in class algs.model.search.StringFileIterator
 
next() - Method in class algs.model.tree.AbstractBinaryTraversal
Returns the next node in the traversal.
next() - Method in class algs.model.tree.ValueExtractor
Delegate request to the internal iterator and extract its value.
nextDimension(DimensionalNode) - Method in class algs.model.kdtree.KDTree
Helper method to always determine the next dimensionality given a node.
nextDimension(int) - Method in class algs.model.kdtree.KDTree
Helper method to always determine the next dimensionality given an integer representing the specified dimension in the KDTree.
Node<E> - Class in algs.model.list
Node in a singly-linked list.
Node(E) - Constructor for class algs.model.list.Node
Node constructed with value.
nodeLabel() - Method in interface algs.debug.IGraphEntity
Return string label for this entity.
nodeLabel() - Method in class algs.debug.Legend
Return label from the legend.
nodeLabel() - Method in class algs.model.gametree.debug.AlphaBetaDebugNode
Compute label for Dotty output.
nodeLabel() - Method in class algs.model.gametree.debug.AlphaPrune
Return label for node.
nodeLabel() - Method in class algs.model.gametree.debug.MinMaxNode
Show computed value with prefix of MIN/MAX as appropriate.
nodeLabel() - Method in class algs.model.gametree.debug.NegMaxNode
Return node label that properly shows value.
nodeLabel() - Method in class algs.model.gametree.debug.ScoreNode
Label for this node encodes the score.
nodeLabel() - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Return label to appear within the debugger output.
nodeLabel() - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
 
nodeLabel() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
Note that gameState changes constantly, so we can do nothing more than grab information and cache it here.
nodeLabel() - Method in class algs.model.tree.BalancedBinaryNode
 
nodeLabel() - Method in class algs.model.tree.BinaryNode
Node Label for binary node.
nodeLabel() - Method in class algs.model.tree.RightThreadedBinaryNode
Expose threaded value in the node label.
nodes - Variable in class algs.debug.DottyDebugger
Nodes.
nodeType() - Method in class algs.debug.DottyDebugger
Default to having nodes with complex record shapes.
NON_INTERSECTING - Static variable in interface algs.model.ILineSegment
 
numClosed - Variable in class algs.model.searchtree.AStarSearch
 
numClosed - Variable in class algs.model.searchtree.BreadthFirstSearch
 
numClosed - Variable in class algs.model.searchtree.debug.AStarSearch
 
numClosed - Variable in class algs.model.searchtree.debug.BreadthFirstSearch
 
numClosed - Variable in class algs.model.searchtree.debug.DepthFirstSearch
 
numClosed - Variable in class algs.model.searchtree.DepthFirstSearch
 
numColumns() - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Return the number of cells on the board.
numDoubleRecursions - Static variable in class algs.model.kdtree.DimensionalNode
 
numMoves - Variable in class algs.model.searchtree.AStarSearch
 
numMoves - Variable in class algs.model.searchtree.BreadthFirstSearch
 
numMoves - Variable in class algs.model.searchtree.debug.AStarSearch
 
numMoves - Variable in class algs.model.searchtree.debug.BreadthFirstSearch
 
numMoves - Variable in class algs.model.searchtree.debug.DepthFirstSearch
 
numMoves - Variable in class algs.model.searchtree.DepthFirstSearch
 
numMoves() - Method in class algs.model.searchtree.Solution
Number of moves in the solution.
numNodes() - Method in class algs.debug.DottyDebugger
Return the number of nodes in the generated tree.
numOpen - Variable in class algs.model.searchtree.AStarSearch
 
numOpen - Variable in class algs.model.searchtree.BreadthFirstSearch
 
numOpen - Variable in class algs.model.searchtree.debug.AStarSearch
 
numOpen - Variable in class algs.model.searchtree.debug.BreadthFirstSearch
 
numOpen - Variable in class algs.model.searchtree.debug.DepthFirstSearch
 
numOpen - Variable in class algs.model.searchtree.DepthFirstSearch
 
numRecursions - Static variable in class algs.model.kdtree.DimensionalNode
 
numRows() - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Return the number of rows on the board.
numStates - Variable in class algs.model.gametree.AlphaBetaEvaluation
statistical information to evaluate algorithms effectiveness.
numStates - Variable in class algs.model.gametree.MinimaxEvaluation
 
numVertices() - Method in class algs.model.network.DisjointPairs
 
numVertices - Variable in class algs.model.network.FlowNetwork
Number of vertices in the graph.
numVertices - Variable in class algs.model.network.Search
Number of vertices in the graph.

O

OMARK - Static variable in class algs.model.problems.tictactoe.model.Player
Global access to OMark.
opponent(IPlayer) - Method in class algs.model.problems.tictactoe.model.IntelligentAgent
Set the opponent for this agent, which is needed because the search for the best move is going to need the opposing player.
opposite() - Method in interface algs.model.gametree.IComparator
Return opposite comparator.
Optimized - Class in algs.model.network
Optimized implementation of Ford-Fulkerson that uses arrays for all storage.
Optimized(int, int, int, Iterator<EdgeInfo>) - Constructor for class algs.model.network.Optimized
Load up information for this network problem.
OptimizedFlowNetwork - Class in algs.model.network
Store information regarding the graph in a two-dimensional matrix.
OptimizedFlowNetwork(int, int, int, Iterator<EdgeInfo>) - Constructor for class algs.model.network.OptimizedFlowNetwork
Construct an instance of the FlowNetwork problem using optimized array structure to solve problem.
ORDERED - Static variable in class algs.model.searchtree.states.StateStorageFactory
Use Double-Linked lists to maintain an ordered set by score().
ordering(String) - Method in class algs.debug.DottyDebugger
Ordering of children.
output() - Method in class algs.model.network.BipartiteMatchingMinCost
Show the matching.
output() - Method in class algs.model.network.DisjointPairs
 
output() - Method in class algs.model.network.Transshipment
Output the solution grid.
output(Hashtable<IPoint, ILineSegment[]>) - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
Convenient helper class to format the output from intersection algorithms.
outputGraph(FlowNetwork<?>) - Method in class algs.model.network.debug.CreateImage
Output to stdout a dotty representation without cut.
outputGraph(FlowNetwork<?>, boolean) - Method in class algs.model.network.debug.CreateImage
Output to stdout a dotty representation and include the minCut.

P

Pair - Class in algs.model.gametree
Combines an IGameState position with a MoveEvaluation that produced the game state.
Pair(IGameState, MoveEvaluation) - Constructor for class algs.model.gametree.Pair
Pair together the given game state and move evaluation.
Pair - Class in algs.model.network.matching
Represents a matching from the potential set of vertices in S and T.
Pair(Object, Object) - Constructor for class algs.model.network.matching.Pair
Construct the (element, match) relationship.
PARALLEL - Static variable in interface algs.model.ILineSegment
Types of intersecting line segments.
parameters() - Method in class algs.model.data.circles.UniformGenerator
 
parameters() - Method in class algs.model.data.Generator
Declares the name of the parameters used when constructing the generator in order from left to right.
parameters() - Method in class algs.model.data.nd.ConvertToND
Parameters for wrappeer are derived from inner generator.
parameters() - Method in class algs.model.data.nd.UniformGenerator
 
parameters() - Method in class algs.model.data.points.CircleGenerator
 
parameters() - Method in class algs.model.data.points.HorizontalLineGenerator
 
parameters() - Method in class algs.model.data.points.LoadFromFileGenerator
 
parameters() - Method in class algs.model.data.points.UniformGenerator
 
parameters() - Method in class algs.model.data.points.UniqueGenerator
 
parameters() - Method in class algs.model.data.points.UnusualGenerator
 
parameters() - Method in class algs.model.data.points.VerticalLineGenerator
 
parameters() - Method in class algs.model.data.segments.DoubleGenerator
 
parameters() - Method in class algs.model.data.segments.GridGenerator
 
parameters() - Method in class algs.model.data.segments.HubGenerator
 
parameters() - Method in class algs.model.data.segments.IntegerGenerator
 
parameters() - Method in class algs.model.data.segments.LoadFromFileGenerator
 
parameters() - Method in class algs.model.data.segments.SlidingLadderGenerator
 
parameters() - Method in class algs.model.data.segments.UniformGenerator
 
parent(IMultiPoint) - Method in class algs.model.kdtree.KDTree
Return the parent of the point IF the point were to be inserted into the kd-tree.
parent(IPoint) - Method in class algs.model.kdtree.TwoDTree
Return the parent of the point IF the point were to be inserted into the 2d-tree.
parent() - Method in class algs.model.problems.segmentIntersection.AugmentedNode
 
parent - Variable in class algs.model.tree.BalancedBinaryNode
Parent.
parent() - Method in class algs.model.tree.BalancedBinaryNode
Get parent (needed for rotations and the like).
parent(BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedBinaryNode
Set parent.
PartialHull - Class in algs.model.problems.convexhull
Represents either the top or the bottom of a Convex Hull.
PartialHull(IPoint, IPoint) - Constructor for class algs.model.problems.convexhull.PartialHull
Construct the initial partial hull.
PartialLinkedListHull - Class in algs.model.problems.convexhull.andrew
Represents either the top or the bottom of a Convex Hull.
PartialLinkedListHull(IPoint, IPoint) - Constructor for class algs.model.problems.convexhull.andrew.PartialLinkedListHull
Construct the initial partial hull.
partition(int, int, int) - Method in class algs.model.array.QuickSort
In linear time, group an array into two parts, those less than a certain value (left), and those greater than or equal to a certain value (right).
partition(Comparable[], int, int, int) - Static method in class algs.model.array.Selection
In linear time, group an array into two parts, those less than a certain value (left), and those greater than or equal to a certain value (right).
partition(Object[], int, int, int, Comparator) - Static method in class algs.model.array.Selection
In linear time, group an array into two parts, those less than a certain value (left), and those greater than or equal to a certain value (right).
PISelector - Class in algs.model.array
Funky alternative for selecting a pivot index by using the digits of PI.
PISelector(int) - Constructor for class algs.model.array.PISelector
Number of digits in a row that form the unique number.
PlaceMark - Class in algs.model.problems.tictactoe.model
Place a mark on the TicTacToe Board.
PlaceMark(int, int, Player) - Constructor for class algs.model.problems.tictactoe.model.PlaceMark
Construct a placeMark move with given (col,row) and mark to be placed.
player - Variable in class algs.model.problems.tictactoe.model.PlaceMark
The player making the move.
Player - Class in algs.model.problems.tictactoe.model
Represents a Player in a Tic Tac Toe variation.
Player(char) - Constructor for class algs.model.problems.tictactoe.model.Player
Creates a player with a certain mark.
PlayerFactory - Class in algs.model.problems.tictactoe.model
Factory to properly construct Player objects representing the type of agents playing TicTacToe.
PlayerFactory() - Constructor for class algs.model.problems.tictactoe.model.PlayerFactory
 
point - Variable in class algs.model.kdtree.DimensionalNode
Dimensional-coordinate.
point - Variable in class algs.model.kdtree.TwoDNode
Store the point.
point - Variable in class algs.model.problems.segmentIntersection.EventPoint
The point.
pointOnLeft(IPoint) - Method in interface algs.model.ILineSegment
Determine if the given point is to the left of the line segment, if we view the line segment from the lower (end) point to the upper (start) point.
pointOnLeft(IPoint) - Method in class algs.model.twod.TwoDLineSegment
Given the line segment in its reverse-directed orientation (from lower to upper point), determine if point p is to the left of the line, as you head from lower to upper If it is exactly on the line, then we return false.
pointOnRight(IPoint) - Method in interface algs.model.ILineSegment
Determine if the given point is to the right of the line segment, if we view the line segment from the lower (end) point to the upper (start) point.
pointOnRight(IPoint) - Method in class algs.model.twod.TwoDLineSegment
Given the line segment in its reverse-directed orientation (from lower to upper point), determine if point p is to the right of the line, as you head from lower to upper.
points() - Method in class algs.model.problems.convexhull.andrew.PartialLinkedListHull
Return the points in this Partial Hull.
points() - Method in class algs.model.problems.convexhull.PartialHull
Return the points in this Partial Hull as an Iterator.
pointSorter - Static variable in class algs.model.problems.segmentIntersection.EventPoint
Globally useful sorter, sorts points based on a horizontal sweep line moving vertically down the Cartesian plane.
populate(Iterator<EdgeInfo>) - Method in class algs.model.network.FlowNetworkArray
Helper method to populate edges.
postorder() - Method in class algs.model.tree.BinaryTree
Use post-order traversal over the tree.
postorder() - Method in class algs.model.tree.RightThreadedBinaryTree
Use post-order traversal over the tree.
PostorderTraversal<T extends IBinaryTreeNode> - Class in algs.model.tree
Perform a post traversal of the tree.
PostorderTraversal(T) - Constructor for class algs.model.tree.PostorderTraversal
Start at the given node.
pred(AugmentedNode<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.LineState
Return predececessor leaf in the tree.
pred(DoubleNode<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.linkedlist.LinkedListLineState
Return predecessor line segment in the state to given one.
pred(BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedTree
Return the predecessor node to the given entry.
preorder() - Method in class algs.model.tree.BinaryTree
Use pre-order traversal over the tree.
preorder() - Method in class algs.model.tree.RightThreadedBinaryTree
Use pre-order traversal over the tree.
PreorderTraversal<T extends IBinaryTreeNode> - Class in algs.model.tree
Perform a pre traversal of the tree.
PreorderTraversal(T) - Constructor for class algs.model.tree.PreorderTraversal
Start at the given node.
prePend - Static variable in class algs.model.list.DoubleLinkedList
Force all inserts to be 'prepend'
prev() - Method in class algs.model.list.DoubleNode
Return previous.
prev(DoubleNode<E>) - Method in class algs.model.list.DoubleNode
Modifies the previous link for this node.
prev - Variable in class algs.model.searchtree.Transition
The previous board state.
processPath(VertexInfo[]) - Method in class algs.model.network.FordFulkerson
Augments the flows within the network along the path found from source to sink.
processPath(int, int) - Method in class algs.model.network.Optimized
 
processPath(int, int) - Method in class algs.model.network.OptimizedFlowNetwork
Augments the flows within the network along the path found from source to sink.

Q

qsort(int, int) - Method in class algs.model.array.QuickSort
Sort using quicksort method.
qsort(Comparable[], int, int) - Static method in class algs.model.array.Selection
Sort using Quicksort method.
qsort(Object[], int, int, Comparator) - Static method in class algs.model.array.Selection
Sort using Quicksort method.
QUEUE - Static variable in class algs.model.searchtree.states.StateStorageFactory
Use queue to maintain set.
QuickSort - Class in algs.model.array
Provide class to experiment with 'selectPivotIndex' and different minimum size problems for which InsertionSort is used instead.
QuickSort(Comparable[]) - Constructor for class algs.model.array.QuickSort
 

R

radius - Variable in class algs.model.data.circles.UniformGenerator
The size of each radius.
radius - Variable in class algs.model.data.points.CircleGenerator
Default to unit circle.
Random - Static variable in class algs.model.problems.tictactoe.model.PlayerFactory
Known types.
RandomPlayer - Class in algs.model.problems.tictactoe.model
Randomly makes moves given the logic of the TicTacToe variation.
RandomPlayer(char) - Constructor for class algs.model.problems.tictactoe.model.RandomPlayer
Construct a Random player who determines a move randomly from available open cells.
RandomSelector - Class in algs.model.array
Quicksort selector during partition that selects random element.
RandomSelector() - Constructor for class algs.model.array.RandomSelector
 
rank(String) - Method in class algs.debug.DottyDebugger
Rank orientation of the figure.
raw() - Method in interface algs.model.IMultiPoint
For optimizing computations, return double[] coordinates.
raw() - Method in class algs.model.nd.Hyperpoint
Return copy of points for safe implementation.
raw() - Method in class algs.model.twod.TwoDPoint
Returns the raw representation of this point as an array of two values.
record(IPoint, ILineSegment, ILineSegment) - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
Add the intersection to our report of these two segments.
record(IPoint, List<ILineSegment>[]) - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
Add the intersection to our report.
RED - Static variable in class algs.model.tree.BalancedBinaryNode
Value to use when node is a RED node.
reduce(IPoint[]) - Static method in class algs.model.problems.convexhull.AklToussaint
Remove points that are within the quadrilateral formed by the extreme points at (x,y) axes.
region - Variable in class algs.model.kdtree.DimensionalNode
Region for which we are "responsible"
region() - Method in class algs.model.kdtree.DimensionalNode
Return region being managed.
remove(Object) - Method in class algs.model.interval.SegmentTree
Removes a single instance of the specified element from this collection, if it is present (optional operation).
remove(IInterval) - Method in class algs.model.interval.SegmentTreeNode
Remove the given segment from the SegmentTree.
remove(DoubleNode<E>) - Method in class algs.model.list.DoubleLinkedList
Given DoubleNode already known to exist in the list, remove it.
remove(E) - Method in class algs.model.list.DoubleLinkedList
This will remove given element known to already be in the list.
remove() - Method in class algs.model.list.DoubleLinkedListIterator
Remove the most recent element retrieved by the DoubleLinkedListIterator.next() iterator method.
remove() - Method in class algs.model.list.List
Remove element from the front of the list and return it.
remove() - Method in class algs.model.list.ListIterator
Remove operation not supported for List objects.
remove(K) - Method in class algs.model.problems.segmentIntersection.AugmentedBalancedTree
Overrides deletion by finding the leaf node for this key.
remove(K) - Method in class algs.model.search.AssociativeHashTable
 
remove(Iterator<K>) - Method in class algs.model.search.HashTable
Bulk remove elements from the Hash Table from the Iterator of key values.
remove(K) - Method in interface algs.model.search.IHashtableAccess
Remove the entry from the hash table.
remove(V) - Method in class algs.model.search.ListHashTable
 
remove() - Method in class algs.model.search.StringFileIterator
 
remove() - Method in class algs.model.searchtree.ClosedStates
Not expected to be called since this is the closed list.
remove(INode) - Method in class algs.model.searchtree.ClosedStates
 
remove() - Method in interface algs.model.searchtree.INodeSet
Remove minimum node based on inherent behavior.
remove(INode) - Method in interface algs.model.searchtree.INodeSet
Remove node from node set.
remove() - Method in class algs.model.searchtree.states.StateHash
Not supported since it makes no sense in this context.
remove(INode) - Method in class algs.model.searchtree.states.StateHash
Remove actual entry from the set.
remove() - Method in class algs.model.searchtree.states.StateOrdered
Remove board state with lowest evaluated score.
remove(INode) - Method in class algs.model.searchtree.states.StateOrdered
Remove from the set.
remove() - Method in class algs.model.searchtree.states.StateQueue
Remove a node by taking the first one from the queue.
remove(INode) - Method in class algs.model.searchtree.states.StateQueue
Remove actual value from the set.
remove() - Method in class algs.model.searchtree.states.StateStack
Remove takes the topmost element from the stack.
remove(INode) - Method in class algs.model.searchtree.states.StateStack
Remove actual value from the list.
remove() - Method in class algs.model.searchtree.states.StateTree
Return INode with minimum score value since tree was constructed using StateTree.comp as the comparator.
remove(INode) - Method in class algs.model.searchtree.states.StateTree
Remove actual value from the set whose score is the same.
remove() - Method in class algs.model.tree.AbstractBinaryTraversal
Not supported.
remove(K) - Method in class algs.model.tree.BalancedTree
Removes the mapping for this key from this TreeMap if present.
remove(T) - Method in class algs.model.tree.BinaryTree
Remove the value from the tree.
remove(T) - Method in class algs.model.tree.RightThreadedBinaryTree
Remove the value from the tree.
remove() - Method in class algs.model.tree.ValueExtractor
Immutable iterator.
removeAll() - Method in class algs.model.kdtree.KDTree
Empty the KDTree of all of its internal points.
removeFirst() - Method in class algs.model.list.DoubleLinkedList
Remove first element without altering sort order.
removeIfLowerScore(INode) - Method in class algs.model.searchtree.ClosedStates
Remove state from list if its score is less than the score of the state as it exists within list.
removeLast() - Method in class algs.model.list.DoubleLinkedList
Remove last element without altering sort order.
removeMiddleOfLastThree() - Method in class algs.model.problems.convexhull.andrew.PartialLinkedListHull
Returns middle of last three.
removeMiddleOfLastThree() - Method in class algs.model.problems.convexhull.PartialHull
Returns middle of last three.
report - Variable in class algs.model.problems.segmentIntersection.IntersectionDetection
Reported intersections.
report() - Method in class algs.model.search.AssociativeHashTable
 
report() - Method in class algs.model.search.HashTable
Every Hash Table has the ability to report interesting statistics about itself.
report() - Method in class algs.model.search.ListHashTable
 
report() - Method in class algs.model.search.ListHashTableReporter
Generate and return the collision report.
reset() - Method in class algs.model.kdtree.CounterKDTree
Reset the counter.
reset(TicTacToeBoard) - Method in class algs.model.problems.tictactoe.model.TicTacToeState
Resets to new game, with new board state and X once again starting.
right() - Method in class algs.model.problems.segmentIntersection.AugmentedNode
 
right - Variable in class algs.model.tree.BalancedBinaryNode
Right son.
right() - Method in class algs.model.tree.BalancedBinaryNode
Return right son.
right(BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedBinaryNode
Set the right child.
rightNeighbor(EventPoint) - Method in class algs.model.problems.segmentIntersection.LineState
Find segment within the state that is the closest neighbor (on the right) to the given event point.
rightNeighbor(EventPoint) - Method in class algs.model.problems.segmentIntersection.linkedlist.LinkedListLineState
 
RightThreadedBinaryNode<T extends java.lang.Comparable> - Class in algs.model.tree
A RightThreadedBinaryNode adds a 'thread' link to the successor node in the Binary Tree for the given node.
RightThreadedBinaryNode(Comparable) - Constructor for class algs.model.tree.RightThreadedBinaryNode
Construct a node to belong in a right-threaded binary tree.
RightThreadedBinaryTree<T extends java.lang.Comparable> - Class in algs.model.tree
Unbalanced right-threaded binary tree.
RightThreadedBinaryTree() - Constructor for class algs.model.tree.RightThreadedBinaryTree
Default BinaryTree constructor.
RightThreadTreeDebugger - Class in algs.model.tree.debug
Debugging subclass for right-threaded binary trees.
RightThreadTreeDebugger() - Constructor for class algs.model.tree.debug.RightThreadTreeDebugger
 
root() - Method in class algs.model.problems.segmentIntersection.AugmentedBalancedTree
Helps with type casting
root() - Method in class algs.model.problems.segmentIntersection.LineState
Helper debugging method to return root of the state.
root - Variable in class algs.model.tree.BalancedTree
Root node.
root() - Method in class algs.model.tree.BalancedTree
Returns the root of the tree (or null if empty).
rotateLeft(BalancedBinaryNode<K, K>) - Method in class algs.model.problems.segmentIntersection.AugmentedBalancedTree
 
rotateLeft(BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedTree
From CLR
rotateRight(BalancedBinaryNode<K, K>) - Method in class algs.model.problems.segmentIntersection.AugmentedBalancedTree
 
rotateRight(BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedTree
From CLR
row - Variable in class algs.model.problems.tictactoe.model.Cell
The row for the board location.
row - Variable in class algs.model.problems.tictactoe.model.PlaceMark
The row to contain the mark.
rules() - Method in class algs.model.problems.tictactoe.model.Logic
Return a description of the game and how it is to be played.
rules() - Method in class algs.model.problems.tictactoe.model.StraightLogic
rules of Straight Tic Tac Toe Apply.

S

same(double, double) - Static method in class algs.model.FloatingPoint
When value won't work, because numbers are potentially infinite, then use this one.
sameBoard(TicTacToeBoard) - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Determine if two Boards are the same (including rotations and reflections).
sameWithinEpsilon(Hashtable<IPoint, ILineSegment[]>, Hashtable<IPoint, ILineSegment[]>) - Static method in class algs.model.problems.segmentIntersection.IntersectionDetection
Helper function (for debugging) to ensure that the two resulting computations are the same within an epsilon (for the intersection points).
scale - Variable in class algs.model.data.nd.UniformGenerator
Points are drawn with indices in range [0,scale].
score() - Method in class algs.model.gametree.debug.ScoreNode
Return the score for this node.
score(IGameState, IPlayer) - Method in interface algs.model.gametree.IGameScore
Method to evaluate a game state from a player's perspective.
score(IGameScore) - Method in interface algs.model.gametree.IPlayer
Set the scoring method used by player on the game state.
score - Variable in class algs.model.gametree.MoveEvaluation
The score.
score(INode) - Method in class algs.model.problems.eightpuzzle.BadEvaluator
 
score() - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Compute the score function on the board state.
score(int) - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
External agent rates the board and stores the score here.
score(INode) - Method in class algs.model.problems.eightpuzzle.GoodEvaluator
 
score(INode) - Method in class algs.model.problems.eightpuzzle.WeakEvaluator
 
score() - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Compute the score function on the board state.
score(int) - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
External agent rates the board and stores the score here.
score(INode) - Method in class algs.model.problems.fifteenpuzzle.GoodEvaluator
 
score(IGameState, IPlayer) - Method in class algs.model.problems.tictactoe.model.BoardEvaluation
Provides a default evaluation function for the given board state.
score(IGameState, IPlayer) - Method in class algs.model.problems.tictactoe.model.DefaultEvaluation
Provides a default evaluation function for the given board state.
score() - Method in class algs.model.problems.tictactoe.model.Logic
Each logic may have its own evaluation function to use, which would override the default evaluation stored with the game state.
score - Variable in class algs.model.problems.tictactoe.model.Player
Scoring method used.
score() - Method in class algs.model.problems.tictactoe.model.Player
Returns scoring method.
score(IGameScore) - Method in class algs.model.problems.tictactoe.model.Player
Set the scoring method to use.
score(int) - Method in interface algs.model.searchtree.INode
Set the score for this node.
score() - Method in interface algs.model.searchtree.INode
Evaluate the board state according to the scoring function and return an integer score.
score(INode) - Method in interface algs.model.searchtree.IScore
Evaluate the given state and update its score using our scoring function.
ScoreNode - Class in algs.model.gametree.debug
This node is used when depicting debugging information about the score assigned to a node.
ScoreNode(int) - Constructor for class algs.model.gametree.debug.ScoreNode
Construct a ScoreNode in the visualization to represent scored node.
search(IHypercube, ArrayList<IMultiPoint>) - Method in class algs.model.kdtree.DimensionalNode
Locate all points within the KDTree that fall within the given hypercube.
search(IHypercube, IVisitKDNode) - Method in class algs.model.kdtree.DimensionalNode
Locate all points within the KDTree that fall within the given hyperspace and use given visitor as the computation to perform on that node.
search(IHypercube) - Method in class algs.model.kdtree.KDTree
Locate all points within the KDTree that fall within the given IHypercube.
search(IHypercube, IVisitKDNode) - Method in class algs.model.kdtree.KDTree
Locate all points within the TwoDTree that fall within the given IHypercube and visit those nodes via the given visitor.
search(IRectangle, ArrayList<IPoint>) - Method in class algs.model.kdtree.TwoDNode
Locate all points within the TwoDTree that fall within the given rectangle.
search(IRectangle, IVisitTwoDNode) - Method in class algs.model.kdtree.TwoDNode
Locate all points within the TwoDTree that fall within the given rectangle and use given visitor as the computation to perform on that node.
search(IRectangle) - Method in class algs.model.kdtree.TwoDTree
Locate all points within the TwoDTree that fall within the given rectangle.
search(IRectangle, IVisitTwoDNode) - Method in class algs.model.kdtree.TwoDTree
Locate all points within the TwoDTree that fall within the given rectangle and visit those nodes via the given visitor.
search(int, int) - Method in class algs.model.network.Optimized
 
Search - Class in algs.model.network
Flow Network algorithms depend on locating an augmenting path through the network.
Search(FlowNetwork) - Constructor for class algs.model.network.Search
Configure this augmenting path search with the information it needs to process.
search(IHypercube) - Method in class algs.model.problems.rangeQuery.BruteForceRangeQuery
 
search(IHypercube, IVisitKDNode) - Method in class algs.model.problems.rangeQuery.BruteForceRangeQuery
 
search(K) - Method in class algs.model.search.AssociativeHashTable
Search for the desired value in the HashTable.
search(T[], T) - Method in class algs.model.search.BinarySearch
Search for target in collection.
search(K) - Method in interface algs.model.search.IHashtableAccess
Determine if element exists within the hash table.
search(V) - Method in class algs.model.search.ListHashTable
Search for the desired value in the HashTable.
search(INode, INode) - Method in class algs.model.searchtree.AStarSearch
Initiate the search for the target state.
search(INode, INode) - Method in class algs.model.searchtree.BreadthFirstSearch
Initiate the search for the target state.
search(INode, INode) - Method in class algs.model.searchtree.debug.AStarSearch
Initiate the search for the target state.
search(INode, INode) - Method in class algs.model.searchtree.debug.BreadthFirstSearch
Initiate the search for the target state.
search(INode, INode) - Method in class algs.model.searchtree.debug.DepthFirstSearch
Initiate the search for the target state.
search(INode, INode) - Method in class algs.model.searchtree.DepthFirstSearch
Initiate the search for the target state.
search(INode, INode) - Method in interface algs.model.searchtree.ISearch
Given the initial state, return a Solution to the final state, or null if no such path can be found.
search(K) - Method in class algs.model.tree.BalancedTree
Returns value associated with given key, or null if the map does not contain an entry for the key.
seg_order - Variable in class algs.model.problems.segmentIntersection.LineState
The key point about this comparator is that it is only called when both line segments intersect the horizontal line defined by the y-value of the sweep pt.
seg_order - Variable in class algs.model.problems.segmentIntersection.linkedlist.LinkedListLineState
The key point about this comparator is that it is only called when both line segments intersect the horizontal line defined by the y-value of the sweep pt.
SegmentTree<T extends SegmentTreeNode> - Class in algs.model.interval
Given a fixed set of [1..N] values, the segment tree is a rooted binary tree that manages intervals [begin,end] on a line, where left <= begin < end < right.
SegmentTree(int, int) - Constructor for class algs.model.interval.SegmentTree
Construct the rooted tree to manage segments drawn from the [left, right) domain.
SegmentTree(int, int, IConstructor) - Constructor for class algs.model.interval.SegmentTree
Construct the rooted tree to manage segments drawn from the [left, right) domain.
SegmentTreeNode - Class in algs.model.interval
Nodes of the SegmentTree are constructed from this class.
SegmentTreeNode(int, int) - Constructor for class algs.model.interval.SegmentTreeNode
Construct node for this range.
select(Comparable[], int, int, int) - Static method in class algs.model.array.Selection
Select the kth value in an array (1 ≤ k ≤ right-left+1) through recursive partitioning.
select(Object[], int, int, int, Comparator) - Static method in class algs.model.array.Selection
Select the kth value in an array (1 ≤ k ≤ right-left+1) through recursive partitioning.
Selection - Class in algs.model.array
Helper class to locate selected values from an Array of Comparable.
Selection() - Constructor for class algs.model.array.Selection
 
selectPivotIndex(Comparable[], int, int) - Method in class algs.model.array.FirstSelector
Select leftmost index of ar[left,right] as the pivot index.
selectPivotIndex(Comparable[], int, int) - Method in interface algs.model.array.IPivotIndex
Select a pivot from the given subarray ar[left,right].
selectPivotIndex(Comparable[], int, int) - Method in class algs.model.array.LastSelector
Select rightmost index of ar[left,right] as the pivot index.
selectPivotIndex(Comparable[], int, int) - Method in class algs.model.array.MedianSelector
Compute median of three elements, ar[left], ar[mid], ar[right] to use as the pivot.
selectPivotIndex(Comparable[], int, int) - Method in class algs.model.array.PISelector
Return an index by using digits of PI.
selectPivotIndex(Comparable[], int, int) - Method in class algs.model.array.RandomSelector
Select random index from the ar[left,right] as the pivot element.
selectPivotIndex(Comparable[], int, int) - Static method in class algs.model.array.Selection
Select an appropriate pivot within the [left, right] range.
selectPivotIndex(Object[], int, int, Comparator) - Static method in class algs.model.array.Selection
Select an appropriate pivot within the [left, right] range.
SequentialSearch<T> - Class in algs.model.search
Sequential Search in Java (both for indexed collections as well as collections accessed via iterators).
SequentialSearch() - Constructor for class algs.model.search.SequentialSearch
 
sequentialSearch(T[], T) - Method in class algs.model.search.SequentialSearch
Apply the brute-force Sequential Search algorithm to search the indexed collection (of type T) for the given target item.
sequentialSearch(Iterable<T>, T) - Method in class algs.model.search.SequentialSearch
Apply the brute-force Sequential Search algorithm to search the iterable collection (of type T) for the given target item.
set(int, IGraphEntity) - Method in class algs.model.network.debug.CreateImage
Set the node to be associated with the integer index.
set(int, int, char) - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Sets the cell at given location to contain mark.
setAbove(DimensionalNode) - Method in class algs.model.kdtree.DimensionalNode
Set the node "Above" this one.
setAbove(TwoDNode) - Method in class algs.model.kdtree.TwoDNode
Set node "Above" this one.
setAllowDuplicates(boolean) - Method in class algs.model.tree.BalancedTree
Determine if this tree should allow entries with duplicate keys.
setBelow(DimensionalNode) - Method in class algs.model.kdtree.DimensionalNode
Set the node "Below" this one.
setBelow(TwoDNode) - Method in class algs.model.kdtree.TwoDNode
Set the node "Below" this one.
setBottom(double) - Method in class algs.model.twod.TwoDRectangle
Update bottom of rectangle.
setLeft(int, double) - Method in class algs.model.nd.Hypercube
Set the left-coordinate in the given dimension.
setLeft(double) - Method in class algs.model.twod.TwoDRectangle
Update left of rectangle.
setMinimumSize(int) - Method in class algs.model.array.QuickSort
Set the minimum problem size at and below which InsertionSort is used.
setPivotMethod(IPivotIndex) - Method in class algs.model.array.QuickSort
Determine the method used to select a pivot index.
setRight(int, double) - Method in class algs.model.nd.Hypercube
Set the right-coordinate in the given dimension.
setRight(double) - Method in class algs.model.twod.TwoDRectangle
Update right of rectangle.
setRoot(DimensionalNode) - Method in class algs.model.kdtree.KDTree
Set the root of the KDTree.
setRoot(VerticalNode) - Method in class algs.model.kdtree.TwoDTree
Set the root of the TwoDTree.
setRoot(BinaryNode<T>) - Method in class algs.model.tree.BinaryTree
Helper method to properly set the root for the tree.
setRoot(RightThreadedBinaryNode<T>) - Method in class algs.model.tree.RightThreadedBinaryTree
Helper method to properly set the root for the tree.
setSweepPoint(IPoint) - Method in class algs.model.problems.segmentIntersection.LineState
Set where the sweep line is to appear.
setSweepPoint(IPoint) - Method in class algs.model.problems.segmentIntersection.linkedlist.LinkedListLineState
 
setTop(double) - Method in class algs.model.twod.TwoDRectangle
Update top of rectangle.
setValue(V) - Method in class algs.model.tree.BalancedBinaryNode
Replaces the value currently associated with the key with the given value.
shorter(double[], double) - Method in class algs.model.kdtree.DimensionalNode
Given the target in optimized form, determine if node is closer than min.
ShortestPathArray - Class in algs.model.network
Encapsulate algorithm by which the augmenting path for a Minimal Cost, Maximal Flow network is found.
ShortestPathArray(FlowNetwork<EdgeInfo[][]>) - Constructor for class algs.model.network.ShortestPathArray
 
sign() - Method in interface algs.model.ILineSegment
Return the sign of the slope of the line segment.
sign - Variable in class algs.model.twod.TwoDLineSegment
Sign of Slope.
sign() - Method in class algs.model.twod.TwoDLineSegment
Return sign of slope.
SimpleHash - Class in algs.model.search
Implements standard java.lang.String hash computation on String objects.
SimpleHash(int) - Constructor for class algs.model.search.SimpleHash
hash needs to know size of the table.
sinkIndex() - Method in class algs.model.network.DisjointPairs
 
sinkIndex - Variable in class algs.model.network.FlowNetwork
Index of the sink vertex.
sinkIndex - Variable in class algs.model.network.Search
Index of the sink vertex.
size() - Method in class algs.model.interval.SegmentTree
Returns the count of elements in the tree.
size() - Method in class algs.model.list.DoubleLinkedList
Return size of the list.
size() - Method in class algs.model.list.List
Return size of the list.
size() - Method in class algs.model.problems.convexhull.andrew.PartialLinkedListHull
Helper function to report number of points in the hull.
size() - Method in class algs.model.problems.convexhull.PartialHull
Helper function to report number of points in the hull.
size() - Method in class algs.model.search.HashTable
 
size() - Method in interface algs.model.search.IHashtableAccess
Return the number of elements in the hash table.
size() - Method in class algs.model.searchtree.ClosedStates
Determine number of states in the set.
size() - Method in interface algs.model.searchtree.INodeSet
Return the number of states in the set.
size() - Method in class algs.model.searchtree.states.StateHash
 
size() - Method in class algs.model.searchtree.states.StateOrdered
 
size() - Method in class algs.model.searchtree.states.StateQueue
 
size() - Method in class algs.model.searchtree.states.StateStack
Determine number of states in the set.
size() - Method in class algs.model.searchtree.states.StateTree
 
size - Variable in class algs.model.tree.BalancedTree
Number of entries in the tree.
size() - Method in class algs.model.tree.BalancedTree
Returns the number of key-value mappings in this map.
SlideMove - Class in algs.model.problems.eightpuzzle
Slide a numbered tile from (r,c) to (r', c').
SlideMove(int, int, int, int, int) - Constructor for class algs.model.problems.eightpuzzle.SlideMove
Move from (fromC, fromR) -> (toC, toR)
SlideMove - Class in algs.model.problems.fifteenpuzzle
Slide a numbered tile from (c,r) to (c', r').
SlideMove(int, int, int, int, int) - Constructor for class algs.model.problems.fifteenpuzzle.SlideMove
Move from (fromC, fromR) -> (toC, toR)
SlidingLadderGenerator - Class in algs.model.data.segments
Generators of sample lines to produce maximum number of intersections
SlidingLadderGenerator(double) - Constructor for class algs.model.data.segments.SlidingLadderGenerator
Maximum height of the ladder.
slope() - Method in interface algs.model.ILineSegment
Return the slope of the line segment.
slope() - Method in class algs.model.twod.TwoDLineSegment
Compute slope of line segment, or return Double.NaN for vertical lines.
SlowEventQueue - Class in algs.model.problems.segmentIntersection.priorityqueue
The EventQueue for a horizontal-sweep line algorithm for line segment intersection.
SlowEventQueue() - Constructor for class algs.model.problems.segmentIntersection.priorityqueue.SlowEventQueue
Default constructor.
SlowHull - Class in algs.model.problems.convexhull.slowhull
Computes Convex Hull using a brute force approach that computes all n^3 triangles and removes points that are within a triangle.
SlowHull() - Constructor for class algs.model.problems.convexhull.slowhull.SlowHull
 
SlowLineSweep - Class in algs.model.problems.segmentIntersection.priorityqueue
Uses slow event queue to show degradation of performance when using just a standard priority queue implementation.
SlowLineSweep() - Constructor for class algs.model.problems.segmentIntersection.priorityqueue.SlowLineSweep
 
smallest() - Method in class algs.model.heap.BinaryHeap
Return the PRIORITY of the smallest entry.
smallest() - Method in class algs.model.heap.ExternalBinaryHeap
 
smallestID() - Method in class algs.model.heap.BinaryHeap
Return the integer IDENTIFIER of the smallest entry.
Solution - Class in algs.model.searchtree
Records the solution for a search from an initial state to a solved goal state.
Solution(INode, INode, IDebugSearch) - Constructor for class algs.model.searchtree.Solution
Build the solution and work backwards with a debugger.
Solution(INode, INode) - Constructor for class algs.model.searchtree.Solution
Build the solution and work backwards without a debugger.
Solution(INode, INode, boolean) - Constructor for class algs.model.searchtree.Solution
Build the solution and work backwards without a debugger.
Solution(INode, INode, IDebugSearch, boolean) - Constructor for class algs.model.searchtree.Solution
Build solution with success or not.
sort(Comparable<E>[], int, int) - Method in class algs.model.heap.HeapSort
Sort using Heapsort method.
sort(E[], int, int, Comparator<E>) - Method in class algs.model.heap.HeapSort
Sort using Heapsort method with external comparator.
sourceIndex() - Method in class algs.model.network.DisjointPairs
 
sourceIndex - Variable in class algs.model.network.FlowNetwork
Index of the source vertex.
sourceIndex - Variable in class algs.model.network.Search
Index of the source vertex.
specialUpdateRectangle() - Method in class algs.model.kdtree.TwoDNode
Called once the node has its region properly set, and it must propagate to children (if they exist) in below and above.
split(TwoDNode, boolean) - Method in class algs.model.kdtree.HorizontalNode
 
split(TwoDNode, boolean) - Method in class algs.model.kdtree.TwoDNode
Manipulates child node's region accordingly, based on our own.
split(TwoDNode, boolean) - Method in class algs.model.kdtree.VerticalNode
 
STACK - Static variable in class algs.model.searchtree.states.StateStorageFactory
Use stack to maintain set.
StandardHash<V> - Class in algs.model.search
Implements standard hashCode computation on objects.
StandardHash(int) - Constructor for class algs.model.search.StandardHash
hash needs to know size of the table.
start - Variable in class algs.debug.DottyDebugger
Start key.
start - Variable in class algs.model.network.EdgeInfo
Start of edge.
start - Variable in class algs.model.twod.TwoDLineSegment
Store Line segment start.
startTime() - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
 
state - Variable in class algs.model.gametree.Pair
The game state in consideration.
StateHash - Class in algs.model.searchtree.states
Maintains the set of open states using a Hash.
StateHash() - Constructor for class algs.model.searchtree.states.StateHash
Construct hash to store INode objects.
StateOrdered - Class in algs.model.searchtree.states
Maintains the set of open states in ordered fashion, so the state with the lowest evaluation function can be removed.
StateOrdered() - Constructor for class algs.model.searchtree.states.StateOrdered
Store states using double linked list.
StateQueue - Class in algs.model.searchtree.states
Provide storage that behaves like a queue.
StateQueue() - Constructor for class algs.model.searchtree.states.StateQueue
 
StateStack - Class in algs.model.searchtree.states
Provide storage that behaves like a stack.
StateStack() - Constructor for class algs.model.searchtree.states.StateStack
 
StateStorageFactory - Class in algs.model.searchtree.states
Return an appropriate INodeSet entity.
StateStorageFactory() - Constructor for class algs.model.searchtree.states.StateStorageFactory
 
StateTree - Class in algs.model.searchtree.states
Maintains the set of open states in ordered fashion, using the score() as the ordering value.
StateTree() - Constructor for class algs.model.searchtree.states.StateTree
Construct Binary tree to use.
storageType(int) - Method in class algs.model.searchtree.AStarSearch
Determine structure to use for storing CLOSED set.
storageType(int) - Method in class algs.model.searchtree.BreadthFirstSearch
Determine structure to use for storing CLOSED set.
storageType(int) - Method in class algs.model.searchtree.debug.AStarSearch
Determine structure to use for storing CLOSED set.
storageType(int) - Method in class algs.model.searchtree.debug.BreadthFirstSearch
Determine structure to use for storing CLOSED set.
storageType(int) - Method in class algs.model.searchtree.debug.DepthFirstSearch
Determine structure to use for storing CLOSED set.
storageType(int) - Method in class algs.model.searchtree.DepthFirstSearch
Determine structure to use for storing CLOSED set.
storedData(Object) - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Store the given piece of information with the node and return the last piece of information which had been stored with the node.
storedData() - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Return the data stored with the node.
storedData(Object) - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
 
storedData() - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
 
storedData(Object) - Method in class algs.model.problems.tictactoe.model.TicTacToeState
Store external (optional) state information with this TicTacToe state.
storedData() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
Return external (optional) state information that may have been stored with this state.
storedData(Object) - Method in interface algs.model.searchtree.INode
Store additional information with this search tree, returning the old information that had been stored (if at all).
storedData() - Method in interface algs.model.searchtree.INode
Retrieve additional specific information stored with this search tree.
StoredIntervalsNode - Class in algs.model.interval
When a Segment Tree uses StoredIntervalsNode as the base node type, then a reference to the actual Intervals is stored (in no specific order) with each node in the tree.
StoredIntervalsNode(int, int) - Constructor for class algs.model.interval.StoredIntervalsNode
Store additional information with each SegmentTreeNode
StraightLogic - Class in algs.model.problems.tictactoe.model
Logic of the normal TicTacToe
StraightLogic() - Constructor for class algs.model.problems.tictactoe.model.StraightLogic
 
StringFileIterator - Class in algs.model.search
Return an Iterator for the strings in a File.
StringFileIterator(File) - Constructor for class algs.model.search.StringFileIterator
On constructor set up the Scanner, if possible.
succeeded() - Method in class algs.model.searchtree.Solution
Was this a successful solution?
successor(AugmentedNode<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.LineState
Return successor leaf in the tree.
successor(DoubleNode<ILineSegment>) - Method in class algs.model.problems.segmentIntersection.linkedlist.LinkedListLineState
Return successor line segment in the state to given one.
successor(BalancedBinaryNode<K, V>) - Method in class algs.model.tree.BalancedTree
Returns the successor of the specified Entry, or null if no such.
swap(Object[], int, int) - Static method in class algs.model.array.Selection
Swap the two locations.
swap(int, int, int, int) - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Swap contents of neighboring cells.
swap(int, int, int, int) - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Swap contents of neighboring cells.

T

TicTacToeBoard - Class in algs.model.problems.tictactoe.model
Represents the state of a 3x3 TicTacToe board.
TicTacToeBoard() - Constructor for class algs.model.problems.tictactoe.model.TicTacToeBoard
Constructor for TicTacToe Board.
TicTacToeBoard(char[][]) - Constructor for class algs.model.problems.tictactoe.model.TicTacToeBoard
Helper constructor for initializing boards to arbitrary configurations.
TicTacToeBoard(TicTacToeBoard) - Constructor for class algs.model.problems.tictactoe.model.TicTacToeBoard
Copy Constructor for TicTacToe Board.
TicTacToeDebugger - Class in algs.model.problems.tictactoe.debug
Extends GameTreeDebugger to work with TicTacToe nodes.
TicTacToeDebugger() - Constructor for class algs.model.problems.tictactoe.debug.TicTacToeDebugger
 
TicTacToeState - Class in algs.model.problems.tictactoe.model
The TicTacToe state is determined by a board and the specific logic being used for that board state.
TicTacToeState(TicTacToeBoard, Logic) - Constructor for class algs.model.problems.tictactoe.model.TicTacToeState
The game state is dependent upon a tic-tac-toe board, together with the logic being used to govern the game.
tile - Variable in class algs.model.problems.eightpuzzle.SlideMove
tile being moved.
tile - Variable in class algs.model.problems.fifteenpuzzle.SlideMove
tile being moved.
time() - Method in class algs.model.problems.segmentIntersection.IntersectionDetection
Return last time to complete algorithm (in Milliseconds).
toC - Variable in class algs.model.problems.eightpuzzle.SlideMove
column coordinate of the move's destination.
toC - Variable in class algs.model.problems.fifteenpuzzle.SlideMove
column coordinate of the move's destination.
TooLarge - Static variable in class algs.debug.DottyDebugger
Max string size to return from getInputString().
toR - Variable in class algs.model.problems.eightpuzzle.SlideMove
row coordinate of the move's destination.
toR - Variable in class algs.model.problems.fifteenpuzzle.SlideMove
row coordinate of the move's destination.
toString() - Method in class algs.model.data.Generator
Respond with the name of the appropriate subclass.
toString() - Method in class algs.model.gametree.AlphaBetaEvaluation
Expose board state as string (useful for debugging purposes).
toString() - Method in class algs.model.gametree.debug.AlphaBetaDebugNode
Reasonable toString() method for debugging.
toString() - Method in class algs.model.gametree.debug.AlphaBetaEvaluation
Expose board state as string (useful for debugging purposes).
toString() - Method in class algs.model.gametree.debug.MinimaxEvaluation
Expose board state as string (useful for debugging purposes).
toString() - Method in class algs.model.gametree.debug.NegMaxEvaluation
Expose board state as string (useful for debugging purposes).
toString() - Method in class algs.model.gametree.MinimaxEvaluation
Expose game state as string (useful for debugging purposes).
toString() - Method in class algs.model.gametree.MoveEvaluation
Reasonable toString method.
toString() - Method in class algs.model.gametree.NegMaxEvaluation
Expose board state as string (useful for debugging purposes).
toString() - Method in class algs.model.interval.DiscreteInterval
Return reasonable String representation.
toString() - Method in class algs.model.interval.SegmentTree
Create string representation of the Tree.
toString() - Method in class algs.model.interval.SegmentTreeNode
A shallow representation of this node.
toString() - Method in class algs.model.interval.StoredIntervalsNode
Reasonable extension to toString() method.
toString() - Method in class algs.model.kdtree.DimensionalNode
Reasonable toString method.
toString() - Method in class algs.model.kdtree.KDTree
Reasonable toString to aid debugging.
toString() - Method in class algs.model.kdtree.TwoDNode
Reasonable toString method.
toString() - Method in class algs.model.kdtree.TwoDTree
Reasonable toString to aid debugging.
toString() - Method in class algs.model.list.DoubleLinkedList
Useful string for debugging.
toString() - Method in class algs.model.list.DoubleNode
Return meaningful string.
toString() - Method in class algs.model.list.List
Useful string for debugging.
toString() - Method in class algs.model.nd.Hypercube
Reasonable toString method.
toString() - Method in class algs.model.nd.Hyperpoint
Reasonable toString() implementation.
toString() - Method in class algs.model.network.EdgeInfo
Reasonable toString.
toString() - Method in class algs.model.network.FlowNetworkAdjacencyList
Useful for debugging.
toString() - Method in class algs.model.network.FlowNetworkArray
Useful for debugging.
toString() - Method in class algs.model.network.matching.Pair
Standard toString method.
toString() - Method in class algs.model.network.Optimized
Useful for debugging.
toString() - Method in class algs.model.network.VertexInfo
 
toString() - Method in class algs.model.network.VertexStructure
Useful for debugging.
toString() - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Useful debugging method.
toString() - Method in class algs.model.problems.eightpuzzle.SlideMove
Reasonable implementation.
toString() - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Useful debugging method.
toString() - Method in class algs.model.problems.fifteenpuzzle.SlideMove
Reasonable implementation.
toString() - Method in class algs.model.problems.segmentIntersection.EventPoint
Useful representation.
toString() - Method in class algs.model.problems.tictactoe.model.Cell
Return representation of cell.
toString() - Method in class algs.model.problems.tictactoe.model.PlaceMark
Return object in readable form.
toString() - Method in class algs.model.problems.tictactoe.model.Player
Reasonable toString method, revealing logic for player.
toString() - Method in class algs.model.problems.tictactoe.model.StraightLogic
Return name for logic.
toString() - Method in class algs.model.problems.tictactoe.model.TicTacToeBoard
Return the state of the board as a String.
toString() - Method in class algs.model.problems.tictactoe.model.TicTacToeState
Expose Board state as a string.
toString() - Method in class algs.model.searchtree.Solution
Return solution as a string.
toString() - Method in class algs.model.tree.BalancedBinaryNode
Return string representation of this node.
toString() - Method in class algs.model.tree.BalancedTree
Return parenthetical string of tree structure using inOrder traversal.
toString() - Method in class algs.model.tree.BinaryNode
Return representation of this node.
toString() - Method in class algs.model.tree.BinaryTree
Create string representation of the Tree.
toString() - Method in class algs.model.tree.RightThreadedBinaryTree
Create string representation of the Tree.
toString() - Method in class algs.model.twod.TwoDCircle
 
toString() - Method in class algs.model.twod.TwoDLineSegment
Reasonable toString() implementation.
toString() - Method in class algs.model.twod.TwoDPoint
Reasonable toString() implementation.
toString() - Method in class algs.model.twod.TwoDRectangle
Reasonable representation of this rectangular region.
toTheLeft(int) - Method in interface algs.model.IInterval
Determines if the q value is strictly less than the getLeft() value.
toTheLeft(int) - Method in class algs.model.interval.DiscreteInterval
 
toTheLeft(int) - Method in class algs.model.interval.SegmentTreeNode
 
toTheRight(int) - Method in interface algs.model.IInterval
Determines if the q value is greater than or equal to the getRight() value.
toTheRight(int) - Method in class algs.model.interval.DiscreteInterval
 
toTheRight(int) - Method in class algs.model.interval.SegmentTreeNode
 
Transition - Class in algs.model.searchtree
Stores the move and the previous state that was present when the move was made.
Transition(IMove, INode) - Constructor for class algs.model.searchtree.Transition
Record the move and previous state of this transition.
Transportation - Class in algs.model.network
Given a network having sources S, demanders D, edge capacities c(i,j), edge costs costs[i][j] with m=|S| suppliers and n=|D| demanders, construct a flow, if one exists, which minimizes costs.
Transportation(int[], int[], int[][]) - Constructor for class algs.model.network.Transportation
Problem reduction is immediate since there are no intermediate warehouses.
Transshipment - Class in algs.model.network
Given a network having sources S, intermediate "warehouse" nodes W, and demanders D, edge capacities c(i,j), edge costs costs[i][j] with m=|S| suppliers and n=|D| demanders, construct a flow, if one exists, which minimizes costs.
Transshipment(int[], int[], int[][], int[], int[], int[][], int[][]) - Constructor for class algs.model.network.Transshipment
Construct an instance of the Transshipment problem.
traverse() - Method in class algs.model.kdtree.KDTraversal
Control the traversal of the entire Tree.
traverse(TwoDNode) - Method in class algs.model.kdtree.TwoDTraversal
Traverse starting at this given node.
traverse() - Method in class algs.model.kdtree.TwoDTraversal
Control the traversal of the entire Tree.
TREE - Static variable in class algs.model.searchtree.states.StateStorageFactory
Use balanced binary tree to maintain set.
TrialSuite - Class in algs.model.tests.common
Represents a suite of timed trials.
TrialSuite() - Constructor for class algs.model.tests.common.TrialSuite
 
TwoDCircle - Class in algs.model.twod
A circle is defined by a center point and a radius.
TwoDCircle(TwoDPoint, double) - Constructor for class algs.model.twod.TwoDCircle
Construct a Circle.
TwoDCircle(double, double, double) - Constructor for class algs.model.twod.TwoDCircle
Construct a Circle.
TwoDFactory - Class in algs.model.kdtree
Produces a TwoD-tree from a given input set using recursive median approach.
TwoDFactory() - Constructor for class algs.model.kdtree.TwoDFactory
 
TwoDLineSegment - Class in algs.model.twod
Standard two-dimensional implementation of ILineSegment.
TwoDLineSegment(double, double, double, double) - Constructor for class algs.model.twod.TwoDLineSegment
Helper method for constructing a Line segment from four points.
TwoDLineSegment(IPoint, IPoint) - Constructor for class algs.model.twod.TwoDLineSegment
 
TwoDNode - Class in algs.model.kdtree
Represents the base class of a node in the TwoD tree.
TwoDNode(double, IPoint) - Constructor for class algs.model.kdtree.TwoDNode
Stores the coordinate value to be used for dividing the plane either vertically or horizontally
TwoDPoint - Class in algs.model.twod
Standard two-dimensional implementation of IPoint.
TwoDPoint(double, double) - Constructor for class algs.model.twod.TwoDPoint
Construct a TwoDPoint from the given (x,y) values.
TwoDPoint(IPoint) - Constructor for class algs.model.twod.TwoDPoint
Construct when given an IPoint.
TwoDPoint(String) - Constructor for class algs.model.twod.TwoDPoint
Construct when given a comma-separated string of x,y values as double.
TwoDRectangle - Class in algs.model.twod
Represents a rectangular region in the Cartesian plane.
TwoDRectangle(double, double, double, double) - Constructor for class algs.model.twod.TwoDRectangle
Construct a rectangle from the given cartesian coordinates.
TwoDRectangle(IRectangle) - Constructor for class algs.model.twod.TwoDRectangle
Copy constructor.
TwoDTraversal - Class in algs.model.kdtree
Defines a standard inorder traversal of the TwoDTree and enables subclasses to provide specialized method to take action at each node of the tree.
TwoDTraversal() - Constructor for class algs.model.kdtree.TwoDTraversal
Default constructor to properly enable subclasses to work.
TwoDTraversal(TwoDTree) - Constructor for class algs.model.kdtree.TwoDTraversal
Start traversal at the root.
TwoDTree - Class in algs.model.kdtree
Standard unbalanced 2-dimensional binary tree.
TwoDTree() - Constructor for class algs.model.kdtree.TwoDTree
 

U

undo(IGameState) - Method in interface algs.model.gametree.IGameMove
Undo the move on the game state.
undo(INode) - Method in class algs.model.problems.eightpuzzle.SlideMove
Assume move had been valid, so the undo is a straightforward swap.
undo(INode) - Method in class algs.model.problems.fifteenpuzzle.SlideMove
Assume move had been valid, so the undo is a straightforward swap.
undo(IGameState) - Method in class algs.model.problems.tictactoe.model.Move
Removes the effect of the move from the TicTacToe Board.
undo(IGameState) - Method in class algs.model.problems.tictactoe.model.PlaceMark
Undoes the given move and returns true, or returns false if unable to undo.
undo(INode) - Method in interface algs.model.searchtree.IMove
Undo the move on the board state.
unexplored - Variable in class algs.debug.DottyDebugger
Nodes that appear in the search output but which were never explored.
UnexploredNodeDrawer - Class in algs.debug.drawers
Capable of drawing unexplored nodes in the DOTTY debugging output.
UnexploredNodeDrawer() - Constructor for class algs.debug.drawers.UnexploredNodeDrawer
 
UniformGenerator - Class in algs.model.data.circles
Generator of sample circles.
UniformGenerator(double) - Constructor for class algs.model.data.circles.UniformGenerator
Radius of the circle to be generated.
UniformGenerator - Class in algs.model.data.nd
Generators of sample data points within the [0,scale) unit square.
UniformGenerator(int, double) - Constructor for class algs.model.data.nd.UniformGenerator
Construct generator given desired number of dimensions and scale.
UniformGenerator - Class in algs.model.data.points
Generators of sample data points within the [0,1] unit square.
UniformGenerator() - Constructor for class algs.model.data.points.UniformGenerator
 
UniformGenerator - Class in algs.model.data.segments
Generators of sample lines.
UniformGenerator(int) - Constructor for class algs.model.data.segments.UniformGenerator
Ratio is in the range 1 ..
UniqueGenerator - Class in algs.model.data.points
Generate sample points whose x and y values are all unique integers ≥ 0.
UniqueGenerator() - Constructor for class algs.model.data.points.UniqueGenerator
 
UnusualGenerator - Class in algs.model.data.points
Divide the size into n/4 and create uniform clusters of [0,1] way apart along the +/- X-axis and Y-axis.
UnusualGenerator(double) - Constructor for class algs.model.data.points.UnusualGenerator
Construct the generator given a maximum distance between four clusters.
update(IInterval) - Method in class algs.model.interval.SegmentTreeNode
Algorithms over SegmentTrees often store additional information with each node, and may perform complex computations on insert.
update(IInterval) - Method in class algs.model.interval.StoredIntervalsNode
Algorithms over SegmentTrees often store additional information with each node, and may perform complex computations on insert.
updateRectangles() - Method in class algs.model.kdtree.TwoDTree
Propagate all rectangles down to leaves.
upperEndpointSegments() - Method in class algs.model.problems.segmentIntersection.EventPoint
Return the set of Line segments whose upper (i.e., Start) endpoint is this EventPoint.

V

validate() - Method in class algs.model.list.DoubleLinkedList
If links have been manually modified, then we must validate the size is properly set and there is no circular link.
validate() - Method in class algs.model.network.FlowNetwork
Validate the FlowNetwork.
validate() - Method in class algs.model.network.FlowNetworkAdjacencyList
Validate the FlowNetwork.
validate() - Method in class algs.model.network.FlowNetworkArray
 
validate() - Method in class algs.model.network.Optimized
 
validateArtificialRoot() - Method in class algs.model.tree.RightThreadedBinaryTree
Placed here for the purpose of testing.
validMoves(IGameState) - Method in interface algs.model.gametree.IPlayer
Return the player's valid moves given the game state.
validMoves() - Method in class algs.model.problems.eightpuzzle.EightPuzzleNode
Given the game state, return the set of valid moves.
validMoves() - Method in class algs.model.problems.fifteenpuzzle.FifteenPuzzleNode
Given the game state, return the set of valid moves.
validMoves(IPlayer, IGameState) - Method in class algs.model.problems.tictactoe.model.Logic
Return the valid moves at this board state for the given player.
validMoves(IGameState) - Method in class algs.model.problems.tictactoe.model.Player
Return the valid moves for this player given the game state.
validMoves(IGameState) - Method in class algs.model.problems.tictactoe.model.RandomPlayer
Return the valid moves for this player given the game state.
validMoves() - Method in interface algs.model.searchtree.INode
Return an ordered list of moves that can be made on this board state.
value(double) - Static method in class algs.model.FloatingPoint
See if the value is close enough to actually be considered 0.0 and return 0.0 if need be.
value() - Method in class algs.model.gametree.debug.AlphaBetaDebugNode
Retrieve value for node computed so far.
value(int) - Method in class algs.model.gametree.debug.AlphaBetaDebugNode
Set the value for this node based upon computation.
value() - Method in class algs.model.gametree.debug.MinMaxNode
Return the value of the node.
value(int) - Method in class algs.model.gametree.debug.MinMaxNode
Set the computed value for the node.
value() - Method in class algs.model.gametree.debug.NegMaxNode
Return the computed value.
value(int) - Method in class algs.model.gametree.debug.NegMaxNode
Set the computed value.
value() - Method in class algs.model.list.DoubleNode
Return value stored with the node.
value() - Method in class algs.model.list.Node
Return the value.
value() - Method in class algs.model.tree.BalancedBinaryNode
Return the value for this node.
ValueExtractor<T> - Class in algs.model.tree
Wraps a BinaryNode iterator to be able to extract in a type-safe way the values of the BinaryNodes.
valueOf(String) - Static method in enum algs.model.tree.AbstractBinaryTraversal.Phase
Returns the enum constant of this type with the specified name.
values() - Static method in enum algs.model.tree.AbstractBinaryTraversal.Phase
Returns an array containing the constants of this enum type, in the order they are declared.
VertexInfo - Class in algs.model.network
Stored information by augmenting flow algorithms as it progresses.
VertexInfo(int, boolean) - Constructor for class algs.model.network.VertexInfo
Constructs a vertex in the augmenting path, where previous records the prior vertex in the augmenting path while forward stores its orientation.
VertexInfo(int) - Constructor for class algs.model.network.VertexInfo
By default the vertex info in the path is forward-looking.
VertexStructure - Class in algs.model.network
Records information about a vertex's forward (Outgoing) edges and backward (Incoming) edges.
VertexStructure() - Constructor for class algs.model.network.VertexStructure
 
VerticalLineGenerator - Class in algs.model.data.points
Generate a set of points that all exist on a vertical line (99,y) where y is an integer greater than 0.
VerticalLineGenerator(double) - Constructor for class algs.model.data.points.VerticalLineGenerator
Generator for points along a vertical line.
VerticalNode - Class in algs.model.kdtree
Represents a node in the 2D-tree that partitions the space by means of a vertical line at the given x-coordinate.
VerticalNode(IPoint) - Constructor for class algs.model.kdtree.VerticalNode
X-coordinate is taken from the IPoint.
visit(DimensionalNode) - Method in class algs.model.kdtree.CounterKDTree
 
visit(DimensionalNode) - Method in interface algs.model.kdtree.IVisitKDNode
Specialized behavior during traversals for each node being visited.
visit(TwoDNode) - Method in interface algs.model.kdtree.IVisitTwoDNode
Specialized behavior during traversals for each node being visited.
visit(DimensionalNode) - Method in class algs.model.kdtree.KDTraversal
Specialized behavior will be placed here.
visit(TwoDNode) - Method in class algs.model.kdtree.TwoDTraversal
Specialized behavior will be placed here (when visiting node).
visit(BinaryNode, BinaryNode) - Method in class algs.model.tree.debug.BinaryTreeDebugger
Visit (parent, child) pair by visiting both nodes, then add the edge.
visit(BalancedBinaryNode, BalancedBinaryNode) - Method in class algs.model.tree.debug.BinaryTreeDebugger
 
visit(BinaryNode, BinaryNode) - Method in class algs.model.tree.debug.RightThreadTreeDebugger
Visit right-threaded (parent, child) sequence by visiting both nodes separately, then the edge from parent to child, then any threaded edge, if one exists.
visit(BalancedBinaryNode<K, V>, BalancedBinaryNode<K, V>) - Method in interface algs.model.tree.IBalancedVisitor
Visit a node, and keep in mind its parent.
visit(BinaryNode<T>, BinaryNode<T>) - Method in interface algs.model.tree.IVisitor
Visit a node, and keep in mind its parent.
visitEdge(IGraphEntity, IGraphEntity) - Method in class algs.debug.DottyDebugger
If called multiple times, multiple edges result.
visitEdge(IGraphEntity, IGraphEntity, String) - Method in class algs.debug.DottyDebugger
Assign label to the edge upon creation.
visitEdge(IGraphEntity, IGraphEntity) - Method in interface algs.debug.IDebugSearch
Visit an edge.
visitNode(IGraphEntity) - Method in class algs.debug.DottyDebugger
Mark node as being visited.
visitNode(IGraphEntity) - Method in interface algs.debug.IDebugSearch
Visit a node.
visitNode(IGraphEntity) - Method in class algs.model.problems.tictactoe.debug.TicTacToeDebugger
Mark node as being visited.

W

w - Variable in class algs.model.network.Transshipment
Number of intermediate warehouses.
WeakEvaluator - Class in algs.model.problems.eightpuzzle
Weak evaluation function, as drawn from Nilsson, p.
WeakEvaluator() - Constructor for class algs.model.problems.eightpuzzle.WeakEvaluator
 

X

XMARK - Static variable in class algs.model.problems.tictactoe.model.Player
Global access to XMark.
xValue - Variable in class algs.model.data.points.VerticalLineGenerator
x Coordinate of generated points.
xy_sorter - Static variable in interface algs.model.IPoint
Globally useful sorter, that first sorts by x, and then by y coordinate.

Y

yIntercept() - Method in interface algs.model.ILineSegment
Return the y-intercept of the line segment if it were extended to be a full line.
yIntercept() - Method in class algs.model.twod.TwoDLineSegment
Compute yIntercept of line segment if extended to be a line.
yValue - Variable in class algs.model.data.points.HorizontalLineGenerator
location of horizontal line.

_

_ctr - Static variable in class algs.debug.DottyDebugger
 

A B C D E F G H I K L M N O P Q R S T U V W X Y _
Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.