Uses of Class
org.jheaps.tree.FibonacciHeap.Node

Packages that use FibonacciHeap.Node

Package	Description
org.jheaps.tree	Heaps using an explicit "pointer-based" tree representation

Uses of FibonacciHeap.Node in org.jheaps.tree

Fields in org.jheaps.tree declared as FibonacciHeap.Node

Modifier and Type	Field	Description
private FibonacciHeap.Node<K,V>[]	FibonacciHeap.aux	Auxiliary array for consolidation
(package private) FibonacciHeap.Node<K,V>	FibonacciHeap.Node.child
private FibonacciHeap.Node<K,V>	FibonacciHeap.minRoot	The root with the minimum key
(package private) FibonacciHeap.Node<K,V>	FibonacciHeap.Node.next
(package private) FibonacciHeap.Node<K,V>	FibonacciHeap.Node.parent
(package private) FibonacciHeap.Node<K,V>	FibonacciHeap.Node.prev

Methods in org.jheaps.tree with parameters of type FibonacciHeap.Node

Modifier and Type	Method	Description
private void	FibonacciHeap.addToRootList(FibonacciHeap.Node<K,V> n)
private void	FibonacciHeap.cascadingCut(FibonacciHeap.Node<K,V> y)
private void	FibonacciHeap.cut(FibonacciHeap.Node<K,V> x, FibonacciHeap.Node<K,V> y)
private void	FibonacciHeap.decreaseKey(FibonacciHeap.Node<K,V> n, K newKey)
private void	FibonacciHeap.decreaseKeyWithComparator(FibonacciHeap.Node<K,V> n, K newKey)
private void	FibonacciHeap.forceDecreaseKeyToMinimum(FibonacciHeap.Node<K,V> n)
private void	FibonacciHeap.link(FibonacciHeap.Node<K,V> y, FibonacciHeap.Node<K,V> x)