Package | Description |
---|---|
com.jgraph.algebra |
JGraphLayout algebra package which contains graph algorithms and datastructures.
|
Modifier and Type | Field and Description |
---|---|
protected JGraphFibonacciHeap.Node |
JGraphFibonacciHeap.min |
Modifier and Type | Method and Description |
---|---|
JGraphFibonacciHeap.Node |
JGraphFibonacciHeap.getNode(java.lang.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.
|
Modifier and Type | Method and Description |
---|---|
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.
|
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.link(JGraphFibonacciHeap.Node y,
JGraphFibonacciHeap.Node x)
Make node y a child of node x.
|
Copyright (C) 2001-2009 JGraph Ltd. All rights reserved.