Uses of Class
org.drip.graph.softheap.KaplanZwickBinaryNode

Packages that use KaplanZwickBinaryNode

Package	Description
org.drip.graph.softheap	Soft Heap - Approximate Priority Queue

Uses of KaplanZwickBinaryNode in org.drip.graph.softheap

Methods in org.drip.graph.softheap that return KaplanZwickBinaryNode

Modifier and Type	Method	Description
static <KEY extends java.lang.Comparable<KEY>, ITEM> KaplanZwickBinaryNode<KEY,ITEM>	KaplanZwickBinaryNode.CombineRootNodePair(KaplanZwickBinaryNode<KEY,ITEM> node1, KaplanZwickBinaryNode<KEY,ITEM> node2)	Combine Two Root Nodes of Rank k each to a Root Node of Rank k + 1
static <KEY extends java.lang.Comparable<KEY>, ITEM> KaplanZwickBinaryNode<KEY,ITEM>	KaplanZwickBinaryNode.FromErrorRate(boolean minHeap, double errorRate, int k, KaplanZwickBinaryNode<KEY,ITEM> left, KaplanZwickBinaryNode<KEY,ITEM> right, KaplanZwickBinaryNode<KEY,ITEM> parent)	Construct an Instance of KaplanZwickBinaryNode from the Error Rate
static <KEY extends java.lang.Comparable<KEY>, ITEM> KaplanZwickBinaryNode<KEY,ITEM>	KaplanZwickBinaryNode.LeafRoot(boolean minHeap, int r, PriorityQueueEntry<KEY,ITEM> entry)	Construct a Leaf Root Node of a New Tree with a single Entry
KaplanZwickBinaryNode<KEY,ITEM>	KaplanZwickBinaryNode.left()	Retrieve the Left Tree
KaplanZwickBinaryNode<KEY,ITEM>	KaplanZwickBinaryNode.parent()	Retrieve the Parent Tree
KaplanZwickBinaryNode<KEY,ITEM>	KaplanZwickBinaryNode.right()	Retrieve the Right Tree
KaplanZwickBinaryNode<KEY,ITEM>	KaplanZwickTree.root()	Retrieve the Root of the Tree

Methods in org.drip.graph.softheap that return types with arguments of type KaplanZwickBinaryNode

Modifier and Type	Method	Description
java.util.List<KaplanZwickBinaryNode<KEY,ITEM>>	KaplanZwickBinaryNode.bfsWalk()	Perform a BFS Walk through the Nodes and retrieve them

Methods in org.drip.graph.softheap with parameters of type KaplanZwickBinaryNode

Modifier and Type	Method	Description
static <KEY extends java.lang.Comparable<KEY>, ITEM> KaplanZwickBinaryNode<KEY,ITEM>	KaplanZwickBinaryNode.CombineRootNodePair(KaplanZwickBinaryNode<KEY,ITEM> node1, KaplanZwickBinaryNode<KEY,ITEM> node2)	Combine Two Root Nodes of Rank k each to a Root Node of Rank k + 1
static <KEY extends java.lang.Comparable<KEY>, ITEM> KaplanZwickBinaryNode<KEY,ITEM>	KaplanZwickBinaryNode.FromErrorRate(boolean minHeap, double errorRate, int k, KaplanZwickBinaryNode<KEY,ITEM> left, KaplanZwickBinaryNode<KEY,ITEM> right, KaplanZwickBinaryNode<KEY,ITEM> parent)	Construct an Instance of KaplanZwickBinaryNode from the Error Rate
boolean	KaplanZwickTreeMelder.growTail(KaplanZwickBinaryNode<KEY,ITEM> rootNode)	Grow the Tail Root Node using the Supplied Root Node
boolean	KaplanZwickBinaryNode.setLeft(KaplanZwickBinaryNode<KEY,ITEM> left)	Set the Left Child of the Current Node
boolean	KaplanZwickBinaryNode.setParent(KaplanZwickBinaryNode<KEY,ITEM> parent)	Set the Parent of the Current Node
boolean	KaplanZwickBinaryNode.setRight(KaplanZwickBinaryNode<KEY,ITEM> right)	Set the Right Child of the Current Node
boolean	KaplanZwickTree.setRoot(KaplanZwickBinaryNode<KEY,ITEM> root)	(Re-)set the Root

Constructors in org.drip.graph.softheap with parameters of type KaplanZwickBinaryNode

Constructor	Description
KaplanZwickTree(KaplanZwickBinaryNode<KEY,ITEM> root)	KaplanZwickTree Constructor