Uses of Class
org.jgrapht.util.AVLTree.TreeNode

Packages that use AVLTree.TreeNode

Package	Description
org.jgrapht.alg.connectivity	Algorithms dealing with various connectivity aspects of a graph.
org.jgrapht.util	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.TreeNode

Modifier and Type	Field	Description
(package private) AVLTree.TreeNode<T>	TreeDynamicConnectivity.Arc.arcTreeNode	The occurrence of the source node, which precedes the subtree Euler tour stored in the binary tree

Fields in org.jgrapht.alg.connectivity with type parameters of type AVLTree.TreeNode

Modifier and Type	Field	Description
private java.util.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.TreeNode

Constructor	Description
Arc(TreeDynamicConnectivity.Node target, AVLTree.TreeNode<T> arcTreeNode)	Constructs a new arc with the target node target and the tree node reference arcTreeNode

Uses of AVLTree.TreeNode in org.jgrapht.util

Fields in org.jgrapht.util declared as AVLTree.TreeNode

Modifier and Type	Field	Description
(package private) AVLTree.TreeNode<T>	AVLTree.TreeNode.left	Left child of this node
private AVLTree.TreeNode<T>	AVLTree.TreeNodeIterator.nextNode	A node that is returned next or null 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 traversal
private 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.TreeNode

Modifier and Type	Method	Description
AVLTree.TreeNode<T>	AVLTree.addMax(T value)	Adds value as a maximum element to this tree.
AVLTree.TreeNode<T>	AVLTree.addMin(T value)	Adds the value as a minimum element to this tree
private AVLTree.TreeNode<T>	AVLTree.balanceNode(AVLTree.TreeNode<T> node)	Checks whether the node is unbalanced.
AVLTree.TreeNode<T>	AVLTree.TreeNode.getLeft()	Returns a left child of this node
AVLTree.TreeNode<T>	AVLTree.getMax()	Returns the maximum node in this tree or null if the tree is empty.
AVLTree.TreeNode<T>	AVLTree.getMin()	Returns the minimum node in this tree or null if the tree is empty.
AVLTree.TreeNode<T>	AVLTree.TreeNode.getParent()	Returns a parent of this node
AVLTree.TreeNode<T>	AVLTree.TreeNode.getPredecessor()	Returns a predecessor of this node according to the tree in order traversal, or null if this node is a minimum node in the tree
AVLTree.TreeNode<T>	AVLTree.TreeNode.getRight()	Returns a right child of this node
AVLTree.TreeNode<T>	AVLTree.getRoot()	Returns the root of this tree or null if this tree is empty.
AVLTree.TreeNode<T>	AVLTree.TreeNode.getRoot()	Returns a root of the tree this node is stored in
AVLTree.TreeNode<T>	AVLTree.TreeNode.getSubtreeMax()	Returns a maximum node stored in the subtree rooted at this node
AVLTree.TreeNode<T>	AVLTree.TreeNode.getSubtreeMin()	Returns a minimum node stored in the subtree rooted at this node
AVLTree.TreeNode<T>	AVLTree.TreeNode.getSuccessor()	Returns a successor of this node according to the tree in order traversal, or null if this node is a maximum node in the tree
AVLTree.TreeNode<T>	AVLTree.TreeNode.getTreeMax()	Returns a maximum node stored in the tree
AVLTree.TreeNode<T>	AVLTree.TreeNode.getTreeMin()	Returns a minimum node stored in the tree
private AVLTree.TreeNode<T>	AVLTree.merge(AVLTree.TreeNode<T> junctionNode, AVLTree.TreeNode<T> left, AVLTree.TreeNode<T> right)	Merges the left and right subtrees using the junctionNode.
AVLTree.TreeNode<T>	AVLTree.TreeNodeIterator.next()
AVLTree.TreeNode<T>	AVLTree.predecessor(AVLTree.TreeNode<T> node)	Returns the node, which is before the node in the order defined by this tree.
AVLTree.TreeNode<T>	AVLTree.removeMax()	Removes the maximum node in this tree.
AVLTree.TreeNode<T>	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.TreeNode<T>	AVLTree.successor(AVLTree.TreeNode<T> node)	Returns the node following the node in the order defined by this tree.

Methods in org.jgrapht.util that return types with arguments of type AVLTree.TreeNode

Modifier and Type	Method	Description
java.util.Iterator<AVLTree.TreeNode<T>>	AVLTree.nodeIterator()	Returns an iterator over the tree nodes rather than the node values.

Methods in org.jgrapht.util with parameters of type AVLTree.TreeNode

Modifier and Type	Method	Description
void	AVLTree.addMaxNode(AVLTree.TreeNode<T> newMax)	Adds the newMax as a maximum node to this tree.
void	AVLTree.addMinNode(AVLTree.TreeNode<T> newMin)	Adds the newMin as a minimum node to this tree
private void	AVLTree.balance(AVLTree.TreeNode<T> node)	Performs a node balancing on the path from node up until the root
private void	AVLTree.balance(AVLTree.TreeNode<T> node, AVLTree.TreeNode<T> stop)	Performs a node balancing on the path from node up until the stop node
private AVLTree.TreeNode<T>	AVLTree.balanceNode(AVLTree.TreeNode<T> node)	Checks whether the node is unbalanced.
private void	AVLTree.makeRoot(AVLTree.TreeNode<T> node)	Makes the node the root of this tree
private AVLTree.TreeNode<T>	AVLTree.merge(AVLTree.TreeNode<T> junctionNode, AVLTree.TreeNode<T> left, AVLTree.TreeNode<T> right)	Merges the left and right subtrees using the junctionNode.
AVLTree.TreeNode<T>	AVLTree.predecessor(AVLTree.TreeNode<T> node)	Returns the node, which is before the node 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 to node.
(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 to node.
(package private) void	AVLTree.TreeNode.setSuccessor(AVLTree.TreeNode<T> node)	Updates the successor reference of this node.
private AVLTree<T>	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<T>	AVLTree.splitAfter(AVLTree.TreeNode<T> node)	Splits the tree into two parts.
AVLTree<T>	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 the prevChild with the newChild.
AVLTree.TreeNode<T>	AVLTree.successor(AVLTree.TreeNode<T> node)	Returns the node following the node in the order defined by this tree.

Constructors in org.jgrapht.util with parameters of type AVLTree.TreeNode

Constructor	Description
AVLTree(AVLTree.TreeNode<T> root)	Constructor for internal usage