src/main/java/com/mxgraph/analysis/mxFibonacciHeap.java
public void delete(Node x)
	{
		// make x as small as possible
		decreaseKey(x, Double.NEGATIVE_INFINITY);

		// remove the smallest, which decreases n also
		removeMin();
	}
/**
	 * Deletes a node from the heap given the reference to the node. The trees
	 * in the heap will be consolidated, if necessary. This operation may fail
	 * to remove the correct element if there are nodes with key value
	 * -Infinity.
	 * 
	 * <p>
	 * Running time: O(log n) amortized
	 * </p>
	 * 
	 * @param x The node to remove from the heap.
	 */
Deletes a node from the heap given the reference to the node. The trees
in the heap will be consolidated, if necessary. This operation may fail
to remove the correct element if there are nodes with key value
-Infinity.


Running time: O(log n) amortized


@param x The node to remove from the heap.
Deletes a node from the heap given the reference to the node . The trees in the heap will be consolidated if necessary . This operation may fail to remove the correct element if there are nodes with key value - Infinity . Running time : O ( log n ) amortized @param x The node to remove from the heap .
public void delete(Node x)
	{
		decreaseKey(x, Double.NEGATIVE_INFINITY);
		removeMin();
	}
public void delete ( Node x ) { decreaseKey ( x , Double . NEGATIVE_INFINITY ) ; removeMin ( ) ; }
Deletes a node from the heap given the reference to the node.
Deletes a node from the heap given the reference to the node .
// make x as small as possible // remove the smallest, which decreases n also