Uses of Class
com.mxgraph.analysis.mxFibonacciHeap.Node

Packages that use mxFibonacciHeap.Node

com.mxgraph.analysis

This package provides various algorithms for graph analysis, such as shortest path and minimum spanning tree.

Uses of mxFibonacciHeap.Node in com.mxgraph.analysis

Fields in com.mxgraph.analysis declared as mxFibonacciHeap.Node

protected mxFibonacciHeap.Node

mxFibonacciHeap.min

Fields in com.mxgraph.analysis with type parameters of type mxFibonacciHeap.Node

protected Map<Object,mxFibonacciHeap.Node>

mxFibonacciHeap.nodes Maps from elements to nodes

Methods in com.mxgraph.analysis that return mxFibonacciHeap.Node

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.

Methods in com.mxgraph.analysis with parameters of type mxFibonacciHeap.Node

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.