Uses of Class
org.jgrapht.util.FibonacciHeapNode
-
Packages that use FibonacciHeapNode Package Description org.jgrapht.alg Algorithms provided with JGraphT.org.jgrapht.alg.shortestpath Shortest-path related algorithms.org.jgrapht.alg.spanning Spanning tree and spanner algorithms.org.jgrapht.traverse Graph traversal means.org.jgrapht.util Non-graph-specific data structures, algorithms, and utilities used by JGraphT. -
-
Uses of FibonacciHeapNode in org.jgrapht.alg
Fields in org.jgrapht.alg with type parameters of type FibonacciHeapNode Modifier and Type Field Description protected java.util.Map<V,FibonacciHeapNode<V>>
GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm. nodes
(package private) java.util.Map<V,FibonacciHeapNode<BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry>>
BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier. seen
protected java.util.Map<V,FibonacciHeapNode<V>>
AStarShortestPath. vertexToHeapNodeMap
Deprecated.Methods in org.jgrapht.alg with parameters of type FibonacciHeapNode Modifier and Type Method Description private void
AStarShortestPath. expandNode(FibonacciHeapNode<V> currentNode, V endVertex)
Deprecated. -
Uses of FibonacciHeapNode in org.jgrapht.alg.shortestpath
Fields in org.jgrapht.alg.shortestpath with type parameters of type FibonacciHeapNode Modifier and Type Field Description (package private) java.util.Map<V,FibonacciHeapNode<BidirectionalDijkstraShortestPath.QueueEntry>>
BidirectionalDijkstraShortestPath.SearchFrontier. seen
private java.util.Map<V,FibonacciHeapNode<DijkstraClosestFirstIterator.QueueEntry>>
DijkstraClosestFirstIterator. seen
protected java.util.Map<V,FibonacciHeapNode<V>>
AStarShortestPath. vertexToHeapNodeMap
Methods in org.jgrapht.alg.shortestpath with parameters of type FibonacciHeapNode Modifier and Type Method Description private void
AStarShortestPath. expandNode(FibonacciHeapNode<V> currentNode, V endVertex)
-
Uses of FibonacciHeapNode in org.jgrapht.alg.spanning
Fields in org.jgrapht.alg.spanning with type parameters of type FibonacciHeapNode Modifier and Type Field Description protected java.util.Map<V,FibonacciHeapNode<V>>
GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm. nodes
-
Uses of FibonacciHeapNode in org.jgrapht.traverse
Methods in org.jgrapht.traverse that return FibonacciHeapNode Modifier and Type Method Description private FibonacciHeapNode<ClosestFirstIterator.QueueEntry<V,E>>
ClosestFirstIterator. createSeenData(V vertex, E edge)
The first time we see a vertex, make up a new heap node for it. -
Uses of FibonacciHeapNode in org.jgrapht.util
Fields in org.jgrapht.util declared as FibonacciHeapNode Modifier and Type Field Description (package private) FibonacciHeapNode<T>
FibonacciHeapNode. child
first child node(package private) FibonacciHeapNode<T>
FibonacciHeapNode. left
left sibling nodeprivate FibonacciHeapNode<T>
FibonacciHeap. minNode
Points to the minimum node in the heap.(package private) FibonacciHeapNode<T>
FibonacciHeapNode. parent
parent node(package private) FibonacciHeapNode<T>
FibonacciHeapNode. right
right sibling nodeMethods in org.jgrapht.util that return FibonacciHeapNode Modifier and Type Method 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 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.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.
-