|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use FibNode | |
|---|---|
| mauda.plugin.binqueue | Classes for the binomial-queue plug-in. |
| mauda.plugin.fibheap | Classes and interfaces for the fibonacci-heap plug-in. |
| Uses of FibNode in mauda.plugin.binqueue |
|---|
| Methods in mauda.plugin.binqueue that return FibNode | |
|---|---|
FibNode |
BinQueue.findmin()
|
FibNode |
BinQueue.insert(int k)
|
| Methods in mauda.plugin.binqueue with parameters of type FibNode | |
|---|---|
void |
BinQueue.decreasekey(FibNode FibNode,
int k)
|
int |
BinQueue.delete(FibNode node)
|
| Uses of FibNode in mauda.plugin.fibheap |
|---|
| Fields in mauda.plugin.fibheap declared as FibNode | |
|---|---|
FibNode[] |
FibHeapExt.nodes
|
| Methods in mauda.plugin.fibheap that return FibNode | |
|---|---|
FibNode[] |
FibHeapExt.getAllNodes()
|
FibNode |
FibNode.getChildNode()
|
FibNode |
FibNode.getLeftSibling()
|
FibNode |
FibNode.getParentNode()
Returns the (logical) parent FibNode of this node. |
FibNode |
FibNode.getRightSibling()
|
FibNode |
FibNode.getRoot()
|
FibNode |
FibNode.getSibling()
Used for child-sibling format of trees. |
FibNode |
FibHeap.insert(int k)
Inserts a new node to this Fibonacci heap. |
| Methods in mauda.plugin.fibheap with parameters of type FibNode | |
|---|---|
void |
FibNode.addChild(FibNode newChild)
Links another node N to this one. |
void |
FibNode.cut(FibNode target)
Cuts this node off its parent and joins with target |
void |
FibHeap.decreasekey(FibNode N,
int k)
Decreases the key of the specified node to the specified value. |
int |
FibHeap.delete(FibNode node)
Deletes the specified node from this Fibonacci heap. |
boolean |
FibNode.isLeftOf(FibNode other)
|
void |
FibNode.join(FibNode other,
boolean spaceNeeded)
Joins another node list to the sibling list of this one. |
void |
FibNode.makeRoomFor(FibNode inserted)
Makes room for another subtree to be inserted to the right of this node |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||