## Uses of Class
net.dontdrinkandroot.visualization.util.FibonacciHeapNode

Packages that use FibonacciHeapNode
Package | Description
--- | ---
net.dontdrinkandroot.visualization.util |

### Uses of FibonacciHeapNode in net.dontdrinkandroot.visualization.util

Methods in net.dontdrinkandroot.visualization.util that return FibonacciHeapNode
Modifier and Type | Method and Description
--- | ---
`FibonacciHeapNode<T>` | FibonacciHeap.`decreaseKey(FibonacciHeapNode<T> x, double k)` Decreases the key value for a heap node, given the new value to take on.
`FibonacciHeapNode<T>` | FibonacciHeap.`insert(FibonacciHeapNode<T> node, double key)` Inserts a new data element into the heap.
`FibonacciHeapNode<T>` | FibonacciHeap.`insert(T data, double key)`
`FibonacciHeapNode<T>` | FibonacciHeap.`min()` Returns the smallest element in the heap.
`FibonacciHeapNode<T>` | FibonacciHeap.`removeMin()` Removes the smallest element from the heap.

Methods in net.dontdrinkandroot.visualization.util with parameters of type FibonacciHeapNode
Modifier and Type | Method and Description
--- | ---
`protected void` | FibonacciHeap.`cascadingCut(FibonacciHeapNode<T> y)` Performs a cascading cut operation.
`protected void` | FibonacciHeap.`cut(FibonacciHeapNode<T> x, FibonacciHeapNode<T> y)` The reverse of the link operation: removes x from the child list of y.
`protected void` | FibonacciHeap.`cut(FibonacciHeapNode<T> x, FibonacciHeapNode<T> y)` The reverse of the link operation: removes x from the child list of y.
`FibonacciHeapNode<T>` | FibonacciHeap.`decreaseKey(FibonacciHeapNode<T> x, double k)` Decreases the key value for a heap node, given the new value to take on.
`void` | FibonacciHeap.`delete(FibonacciHeapNode<T> x)` Deletes a node from the heap given the reference to the node.
`FibonacciHeapNode<T>` | FibonacciHeap.`insert(FibonacciHeapNode<T> node, double key)` Inserts a new data element into the heap.
`protected void` | FibonacciHeap.`link(FibonacciHeapNode<T> y, FibonacciHeapNode<T> x)` Make node y a child of node x.
`protected void` | FibonacciHeap.`link(FibonacciHeapNode<T> y, FibonacciHeapNode<T> x)` Make node y a child of node x.