Uses of Class
com.jgraph.algebra.JGraphFibonacciHeap.Node
Packages that use JGraphFibonacciHeap.Node
Package
Description
JGraphLayout algebra package which contains graph algorithms and datastructures.
-
Uses of JGraphFibonacciHeap.Node in com.jgraph.algebra
Fields in com.jgraph.algebra declared as JGraphFibonacciHeap.NodeMethods in com.jgraph.algebra that return JGraphFibonacciHeap.NodeModifier and TypeMethodDescriptionReturns the node that represents element.JGraphFibonacciHeap.min()Returns the smallest element in the heap.JGraphFibonacciHeap.removeMin()Removes the smallest element from the heap.Methods in com.jgraph.algebra with parameters of type JGraphFibonacciHeap.NodeModifier and TypeMethodDescriptionprotected voidJGraphFibonacciHeap.cascadingCut(JGraphFibonacciHeap.Node y) Performs a cascading cut operation.protected voidJGraphFibonacciHeap.cut(JGraphFibonacciHeap.Node x, JGraphFibonacciHeap.Node y) The reverse of the link operation: removes x from the child list of y.voidJGraphFibonacciHeap.decreaseKey(JGraphFibonacciHeap.Node x, double k) Decreases the key value for a heap node, given the new value to take on.voidJGraphFibonacciHeap.delete(JGraphFibonacciHeap.Node x) Deletes a node from the heap given the reference to the node.voidJGraphFibonacciHeap.insert(JGraphFibonacciHeap.Node node, double key) Inserts a new data element into the heap.protected voidJGraphFibonacciHeap.link(JGraphFibonacciHeap.Node y, JGraphFibonacciHeap.Node x) Make node y a child of node x.