|
MATES 3.0-rc2 | ||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use FibonacciHeap.Node | |
org.mates.util |
Uses of FibonacciHeap.Node in org.mates.util |
Methods in org.mates.util that return FibonacciHeap.Node | |
FibonacciHeap.Node |
FibonacciHeap.insert(java.lang.Object object,
int key)
Inserts a new data element into the heap, creating a new node for it in the process. |
FibonacciHeap.Node |
FibonacciHeap.insert(java.lang.Object object,
double key)
Inserts a new data element into the heap, creating a new node for it in the process. |
FibonacciHeap.Node |
FibonacciHeap.extreme()
Returns the smallest element in the heap if this is a min heap, or the largest if this is a max heap. |
FibonacciHeap.Node |
FibonacciHeap.removeExtreme()
Removes the smallest element from the heap if this is a min heap, or the largest element if this is a max heap. |
Methods in org.mates.util with parameters of type FibonacciHeap.Node | |
void |
FibonacciHeap.changeKey(FibonacciHeap.Node x,
double k)
Changes the key value for a heap node, given the new value to take on. |
void |
FibonacciHeap.delete(FibonacciHeap.Node x)
Deletes a node from the heap given the reference to the node. |
void |
FibonacciHeap.insert(FibonacciHeap.Node node,
double key)
Inserts a new data element into the heap. |
protected void |
FibonacciHeap.cascadingCut(FibonacciHeap.Node y)
Performs a cascading cut operation. |
protected void |
FibonacciHeap.cut(FibonacciHeap.Node x,
FibonacciHeap.Node y)
The reverse of the link operation: removes x from the child list of y. |
protected void |
FibonacciHeap.link(FibonacciHeap.Node y,
FibonacciHeap.Node x)
Make node y a child of node x. |
|
MATES 3.0-rc2 | ||||||||||
PREV NEXT | FRAMES NO FRAMES |