|
JGraph |
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use JGraphFibonacciHeap.Node | |
com.jgraph.algebra | JGraphLayout algebra package which contains graph algorithms and datastructures. |
Uses of JGraphFibonacciHeap.Node in com.jgraph.algebra |
Fields in com.jgraph.algebra declared as JGraphFibonacciHeap.Node | |
protected JGraphFibonacciHeap.Node |
JGraphFibonacciHeap.min
|
Methods in com.jgraph.algebra that return JGraphFibonacciHeap.Node | |
JGraphFibonacciHeap.Node |
JGraphFibonacciHeap.getNode(Object element,
boolean create)
Returns the node that represents element. |
JGraphFibonacciHeap.Node |
JGraphFibonacciHeap.min()
Returns the smallest element in the heap. |
JGraphFibonacciHeap.Node |
JGraphFibonacciHeap.removeMin()
Removes the smallest element from the heap. |
Methods in com.jgraph.algebra with parameters of type JGraphFibonacciHeap.Node | |
void |
JGraphFibonacciHeap.decreaseKey(JGraphFibonacciHeap.Node x,
double k)
Decreases the key value for a heap node, given the new value to take on. |
void |
JGraphFibonacciHeap.delete(JGraphFibonacciHeap.Node x)
Deletes a node from the heap given the reference to the node. |
void |
JGraphFibonacciHeap.insert(JGraphFibonacciHeap.Node node,
double key)
Inserts a new data element into the heap. |
protected void |
JGraphFibonacciHeap.cascadingCut(JGraphFibonacciHeap.Node y)
Performs a cascading cut operation. |
protected void |
JGraphFibonacciHeap.cut(JGraphFibonacciHeap.Node x,
JGraphFibonacciHeap.Node y)
The reverse of the link operation: removes x from the child list of y. |
protected void |
JGraphFibonacciHeap.link(JGraphFibonacciHeap.Node y,
JGraphFibonacciHeap.Node x)
Make node y a child of node x. |
|
JGraph |
||||||||||
PREV NEXT | FRAMES NO FRAMES |