Uses of Class
org.jgrapht.util.AVLTree.TreeNode
Packages that use AVLTree.TreeNode
Package
Description
Algorithms dealing with various connectivity aspects of a graph.
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
-
Uses of AVLTree.TreeNode in org.jgrapht.alg.connectivity
Fields in org.jgrapht.alg.connectivity declared as AVLTree.TreeNodeModifier and TypeFieldDescription(package private) AVLTree.TreeNode
<T> TreeDynamicConnectivity.Arc.arcTreeNode
The occurrence of the source node, which precedes the subtree Euler tour stored in the binary treeFields in org.jgrapht.alg.connectivity with type parameters of type AVLTree.TreeNodeModifier and TypeFieldDescriptionprivate Map
<AVLTree.TreeNode<T>, AVLTree<T>> TreeDynamicConnectivity.minToTreeMap
Mapping from tree minimums to the trees they're stored in.Constructors in org.jgrapht.alg.connectivity with parameters of type AVLTree.TreeNodeModifierConstructorDescriptionArc
(TreeDynamicConnectivity<T>.Node target, AVLTree.TreeNode<T> arcTreeNode) Constructs a new arc with the target nodetarget
and the tree node referencearcTreeNode
-
Uses of AVLTree.TreeNode in org.jgrapht.util
Fields in org.jgrapht.util declared as AVLTree.TreeNodeModifier and TypeFieldDescription(package private) AVLTree.TreeNode
<T> AVLTree.TreeNode.left
Left child of this nodeprivate AVLTree.TreeNode
<T> AVLTree.TreeNodeIterator.nextNode
A node that is returned next ornull
if all nodes are traversed(package private) AVLTree.TreeNode
<T> AVLTree.TreeNode.parent
Parent of this node(package private) AVLTree.TreeNode
<T> AVLTree.TreeNode.predecessor
Previous node in the tree according to the in order traversal(package private) AVLTree.TreeNode
<T> AVLTree.TreeNode.right
Right child of this node(package private) AVLTree.TreeNode
<T> AVLTree.TreeNode.subtreeMax
A maximum node in the subtree rooted at this node(package private) AVLTree.TreeNode
<T> AVLTree.TreeNode.subtreeMin
A minimum node in the subtree rooted at this node(package private) AVLTree.TreeNode
<T> AVLTree.TreeNode.successor
Next node in the tree according to the in order traversalprivate AVLTree.TreeNode
<T> AVLTree.virtualRoot
An auxiliary node which's always present in a tree and doesn't contain any data.Methods in org.jgrapht.util that return AVLTree.TreeNodeModifier and TypeMethodDescriptionAddsvalue
as a maximum element to this tree.Adds thevalue
as a minimum element to this treeprivate AVLTree.TreeNode
<T> AVLTree.balanceNode
(AVLTree.TreeNode<T> node) Checks whether thenode
is unbalanced.AVLTree.TreeNode.getLeft()
Returns a left child of this nodeAVLTree.getMax()
Returns the maximum node in this tree or null if the tree is empty.AVLTree.getMin()
Returns the minimum node in this tree or null if the tree is empty.AVLTree.TreeNode.getParent()
Returns a parent of this nodeAVLTree.TreeNode.getPredecessor()
Returns a predecessor of this node according to the tree in order traversal, ornull
if this node is a minimum node in the treeAVLTree.TreeNode.getRight()
Returns a right child of this nodeAVLTree.getRoot()
Returns the root of this tree or null if this tree is empty.AVLTree.TreeNode.getRoot()
Returns a root of the tree this node is stored inAVLTree.TreeNode.getSubtreeMax()
Returns a maximum node stored in the subtree rooted at this nodeAVLTree.TreeNode.getSubtreeMin()
Returns a minimum node stored in the subtree rooted at this nodeAVLTree.TreeNode.getSuccessor()
Returns a successor of this node according to the tree in order traversal, ornull
if this node is a maximum node in the treeAVLTree.TreeNode.getTreeMax()
Returns a maximum node stored in the treeAVLTree.TreeNode.getTreeMin()
Returns a minimum node stored in the treeprivate AVLTree.TreeNode
<T> AVLTree.merge
(AVLTree.TreeNode<T> junctionNode, AVLTree.TreeNode<T> left, AVLTree.TreeNode<T> right) Merges theleft
andright
subtrees using thejunctionNode
.AVLTree.TreeNodeIterator.next()
AVLTree.predecessor
(AVLTree.TreeNode<T> node) Returns the node, which is before thenode
in the order defined by this tree.AVLTree.removeMax()
Removes the maximum node in this tree.AVLTree.removeMin()
Removes the minimum node in this tree.private AVLTree.TreeNode
<T> AVLTree.rotateLeft
(AVLTree.TreeNode<T> node) Performs a left node rotation.private AVLTree.TreeNode
<T> AVLTree.rotateRight
(AVLTree.TreeNode<T> node) Performs a right node rotation.AVLTree.successor
(AVLTree.TreeNode<T> node) Returns the node following thenode
in the order defined by this tree.Methods in org.jgrapht.util that return types with arguments of type AVLTree.TreeNodeModifier and TypeMethodDescriptionAVLTree.nodeIterator()
Returns an iterator over the tree nodes rather than the node values.Methods in org.jgrapht.util with parameters of type AVLTree.TreeNodeModifier and TypeMethodDescriptionvoid
AVLTree.addMaxNode
(AVLTree.TreeNode<T> newMax) Adds thenewMax
as a maximum node to this tree.void
AVLTree.addMinNode
(AVLTree.TreeNode<T> newMin) Adds thenewMin
as a minimum node to this treeprivate void
AVLTree.balance
(AVLTree.TreeNode<T> node) Performs a node balancing on the path fromnode
up until the rootprivate void
AVLTree.balance
(AVLTree.TreeNode<T> node, AVLTree.TreeNode<T> stop) Performs a node balancing on the path fromnode
up until thestop
nodeprivate AVLTree.TreeNode
<T> AVLTree.balanceNode
(AVLTree.TreeNode<T> node) Checks whether thenode
is unbalanced.private void
AVLTree.makeRoot
(AVLTree.TreeNode<T> node) Makes thenode
the root of this treeprivate AVLTree.TreeNode
<T> AVLTree.merge
(AVLTree.TreeNode<T> junctionNode, AVLTree.TreeNode<T> left, AVLTree.TreeNode<T> right) Merges theleft
andright
subtrees using thejunctionNode
.AVLTree.predecessor
(AVLTree.TreeNode<T> node) Returns the node, which is before thenode
in the order defined by this tree.private AVLTree.TreeNode
<T> AVLTree.rotateLeft
(AVLTree.TreeNode<T> node) Performs a left node rotation.private AVLTree.TreeNode
<T> AVLTree.rotateRight
(AVLTree.TreeNode<T> node) Performs a right node rotation.(package private) void
AVLTree.TreeNode.setLeftChild
(AVLTree.TreeNode<T> node) Sets the left child reference of this node tonode
.(package private) void
AVLTree.TreeNode.setPredecessor
(AVLTree.TreeNode<T> node) Updates the predecessor reference of this node.(package private) void
AVLTree.TreeNode.setRightChild
(AVLTree.TreeNode<T> node) Sets the right child reference of this node tonode
.(package private) void
AVLTree.TreeNode.setSuccessor
(AVLTree.TreeNode<T> node) Updates the successor reference of this node.AVLTree.split
(AVLTree.TreeNode<T> left, AVLTree.TreeNode<T> right, AVLTree.TreeNode<T> p, boolean leftMove) Traverses the tree up until the virtual root and splits it into two parts.AVLTree.splitAfter
(AVLTree.TreeNode<T> node) Splits the tree into two parts.AVLTree.splitBefore
(AVLTree.TreeNode<T> node) Splits the tree into two parts.(package private) void
AVLTree.TreeNode.substituteChild
(AVLTree.TreeNode<T> prevChild, AVLTree.TreeNode<T> newChild) Substitutes theprevChild
with thenewChild
.AVLTree.successor
(AVLTree.TreeNode<T> node) Returns the node following thenode
in the order defined by this tree.Constructors in org.jgrapht.util with parameters of type AVLTree.TreeNodeModifierConstructorDescriptionprivate
AVLTree
(AVLTree.TreeNode<T> root) Constructor for internal usage