java.lang.Object
org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Arc
- Enclosing class:
TreeDynamicConnectivity<T>
An internal representation of the tree edges.
Two arcs are created for every existing tree edge. This complies with the way an Euler tour is constructed.
-
Field Summary
FieldsModifier and TypeFieldDescription(package private) AVLTree.TreeNode
<T> The occurrence of the source node, which precedes the subtree Euler tour stored in the binary tree(package private) DoublyLinkedList.ListNode
<TreeDynamicConnectivity<T>.Arc> A list node this arc is stored in.(package private) TreeDynamicConnectivity<T>.Node
The target of this arc -
Constructor Summary
ConstructorsConstructorDescriptionArc
(TreeDynamicConnectivity<T>.Node target, AVLTree.TreeNode<T> arcTreeNode) Constructs a new arc with the target nodetarget
and the tree node referencearcTreeNode
-
Method Summary
-
Field Details
-
target
TreeDynamicConnectivity<T>.Node targetThe target of this arc -
listNode
DoublyLinkedList.ListNode<TreeDynamicConnectivity<T>.Arc> listNodeA list node this arc is stored in. This is needed for constant time query time on the doubly linked list. -
arcTreeNode
AVLTree.TreeNode<T> arcTreeNodeThe occurrence of the source node, which precedes the subtree Euler tour stored in the binary tree
-
-
Constructor Details
-
Arc
Constructs a new arc with the target nodetarget
and the tree node referencearcTreeNode
- Parameters:
target
- target node of this arcarcTreeNode
- source tree node reference
-
-
Method Details