Package | Description |
---|---|
com.mxgraph.analysis |
This package provides various algorithms for graph analysis, such as
shortest path and minimum spanning tree.
|
Modifier and Type | Field and Description |
---|---|
protected mxFibonacciHeap.Node |
mxFibonacciHeap.min |
Modifier and Type | Field and Description |
---|---|
protected Map<Object,mxFibonacciHeap.Node> |
mxFibonacciHeap.nodes
Maps from elements to nodes
|
Modifier and Type | Method and Description |
---|---|
mxFibonacciHeap.Node |
mxFibonacciHeap.getNode(Object element,
boolean create)
Returns the node that represents element.
|
mxFibonacciHeap.Node |
mxFibonacciHeap.min()
Returns the smallest element in the heap.
|
mxFibonacciHeap.Node |
mxFibonacciHeap.removeMin()
Removes the smallest element from the heap.
|
Modifier and Type | Method and Description |
---|---|
protected void |
mxFibonacciHeap.cascadingCut(mxFibonacciHeap.Node y)
Performs a cascading cut operation.
|
protected void |
mxFibonacciHeap.cut(mxFibonacciHeap.Node x,
mxFibonacciHeap.Node y)
The reverse of the link operation: removes x from the child list of y.
|
void |
mxFibonacciHeap.decreaseKey(mxFibonacciHeap.Node x,
double k)
Decreases the key value for a heap node, given the new value to take on.
|
void |
mxFibonacciHeap.delete(mxFibonacciHeap.Node x)
Deletes a node from the heap given the reference to the node.
|
void |
mxFibonacciHeap.insert(mxFibonacciHeap.Node node,
double key)
Inserts a new data element into the heap.
|
protected void |
mxFibonacciHeap.link(mxFibonacciHeap.Node y,
mxFibonacciHeap.Node x)
Make node y a child of node x.
|
Copyright (c) 2010 Gaudenz Alder, David Benson. All rights reserved.