Interface | Description |
---|---|
BinaryTreeNode<T extends BinaryTreeNode<T>> |
A
TreeNode specialization with only two child nodes, left and right. |
GraphNode<T extends GraphNode<T>> |
A node in a directed graph (that may have cycles).
|
MutableBinaryTreeNode<T extends MutableBinaryTreeNode<T>> |
A
MutableTreeNode specialization also satisfying the BinaryTreeNode interface
and providing mutability methods. |
MutableTreeNode<T extends MutableTreeNode<T>> |
A
TreeNode specialiation that allow for mutability of the tree structure. |
TreeNode<T extends TreeNode<T>> |
A specialization of a
GraphNode that contains a reference to its parent, thereby making the graph a tree
(since each node can now have only one parent node). |
Class | Description |
---|---|
GraphUtils |
General utility methods for operating on directed graphs (consisting of
GraphNode s). |
ImmutableBinaryTreeNode<T extends BinaryTreeNode<T>> |
A simple immutable implementation of the
BinaryTreeNode interface. |
ImmutableGraphNode<T extends GraphNode<T>> |
A simple, immutable
GraphNode implementation. |
ImmutableTreeNode<T extends TreeNode<T>> |
An
ImmutableGraphNode specialization representing a tree node with a parent field linking back to the nodes
(only) parent. |
MutableBinaryTreeNodeImpl<T extends MutableBinaryTreeNode<T>> |
A simple
MutableBinaryTreeNode implementation based on the MutableTreeNodeImpl . |
MutableTreeNodeImpl<T extends MutableTreeNode<T>> |
A base implementation of the
MutableTreeNode . |
TreeUtils |
General utility methods for operating on tree, i.e.
|