All Classes and Interfaces
Class
Description
An abstract
Visitor that performs a non-recursive (iterative) in-order traversal of a binary tree.Deprecated.
An abstract
Visitor that performs an iterative post-order traversal (Left, Right, Root).Deprecated.
AbstractPostOrderVisitor reflects an obsolete implementation that doesn't strictly bind the
principle of Visitor pattern.An abstract
Visitor that performs an iterative pre-order traversal (Root, Left, Right).Deprecated.
AbstractPreOrderVisitor reflects an obsolete implementation that doesn't strictly bind the
principle of Visitor pattern.A base class that implements the path-traversal algorithm of a binary tree.
Deprecated.
AbstractInOrderVisitor reflects an obsolete implementation that doesn't strictly bind the
principle of Visitor pattern.Represents an operation to be performed on the general Breath-First Search (BFS) algorithm and let us define ad-hoc
operation by reusing the general BFS.
Binary tree gearbox that can be used practically.
Serializes and deserializes a binary search tree.
Measures the depth of a binary tree.
A class that implements the
disjoint-set data structure.
The algorithm used to merge
two sets.
The main entry point for the gearbox web service.
REST controller dedicated to providing operational health checks for the service.
ImmutableTreeNode encapsulates the value, left tree reference, and right tree reference in an immutable
state; it also represents a concrete 'Element', i.e.A representation of interval bounded by comparable class.
Implementations of Knapsack algorithm and its derivatives.
A record to hold the result of the
Knapsack.knapsack(List, List, int) calculation as concise way to create
immutable data carrier classes.A cache class with Least Recently Used (LRU) eviction policy.
A 2D tensor.
MutableTreeNode saves the memory footprint of TreeNode and is suitable for the performance intensive
application.Represents a node in graph that can be 'visited' by a
NodeVisitor.The abstract parent type that all BFS visitor must implement and encapsulates the operations for each user-defined
problem.
When data can be process in 1-D space.
Deprecated.
PreOrderSearch reflects an obsolete implementation that doesn't strictly bind the
principle of Visitor pattern.RootToLeafPathsMaker constructs and maintains an immutable list of root-to-leaf paths of a binary tree.Deprecated.
Size reflects an obsolete implementation that doesn't strictly bind the principle of Visitor
pattern.A
Function that, given a list of Interval's and BiPredicate, locates (if any) an element
interval not fully before a specified interval, runs the test predicate on that located interval,
and returns that interval if the interval passes the testSolves the Traveling Salesman Problem (TSP) using the Held-Karp algorithm, which employs dynamic programming with
bitmasking.
A record to immutably hold the result of the TSP calculation.
REST controller that exposes an endpoint for solving the Traveling Salesman Problem.
TreeGraph is a view on top of a binary tree and maps each tree node to its neighbors, including parent and
left&right children.An interface representing a node in a binary tree.
A class responsible for the traversal logic, separated from the
Visitor.Represents the 'Element' participant in the Visitor pattern.
Represents the 'Visitor' participant in the Visitor pattern.
Algorithms on problems that involves concepts of "window".
AbstractInOrderVisitorreflects an obsolete implementation that doesn't strictly bind the principle of Visitor pattern.