Uses of Class
org.jgrapht.util.FibonacciHeapNode

Packages that use FibonacciHeapNode

Package	Description
org.jgrapht.alg.shortestpath	Shortest-path related algorithms.
org.jgrapht.util	Non-graph-specific data structures, algorithms, and utilities used by JGraphT.

Uses of FibonacciHeapNode in org.jgrapht.alg.shortestpath

Fields in org.jgrapht.alg.shortestpath with type parameters of type FibonacciHeapNode

Modifier and Type	Field and Description
protected Map<V,FibonacciHeapNode<V>>	AStarShortestPath.vertexToHeapNodeMap

Uses of FibonacciHeapNode in org.jgrapht.util

Methods in org.jgrapht.util that return FibonacciHeapNode

Modifier and Type	Method and Description
FibonacciHeapNode<T>	FibonacciHeap.min() Returns the smallest element in the heap.
FibonacciHeapNode<T>	FibonacciHeap.removeMin() Removes the smallest element from the heap.

Methods in org.jgrapht.util with parameters of type FibonacciHeapNode

Modifier and Type	Method and Description
protected void	FibonacciHeap.cascadingCut(FibonacciHeapNode<T> y) Performs a cascading cut operation.
protected void	FibonacciHeap.cut(FibonacciHeapNode<T> x, FibonacciHeapNode<T> y) The reverse of the link operation: removes x from the child list of y.
protected void	FibonacciHeap.cut(FibonacciHeapNode<T> x, FibonacciHeapNode<T> y) The reverse of the link operation: removes x from the child list of y.
void	FibonacciHeap.decreaseKey(FibonacciHeapNode<T> x, double k) Decreases the key value for a heap node, given the new value to take on.
void	FibonacciHeap.delete(FibonacciHeapNode<T> x) Deletes a node from the heap given the reference to the node.
void	FibonacciHeap.insert(FibonacciHeapNode<T> node, double key) Inserts a new data element into the heap.
protected void	FibonacciHeap.link(FibonacciHeapNode<T> y, FibonacciHeapNode<T> x) Make node y a child of node x.
protected void	FibonacciHeap.link(FibonacciHeapNode<T> y, FibonacciHeapNode<T> x) Make node y a child of node x.