src/main/java/com/mxgraph/analysis/mxFibonacciHeap.java
public void decreaseKey(Node x, double k)
	{
		if (k > x.key)
		{
			throw new IllegalArgumentException(
					"decreaseKey() got larger key value");
		}

		x.key = k;
		Node y = x.parent;

		if ((y != null) && (x.key < y.key))
		{
			cut(x, y);
			cascadingCut(y);
		}

		if (min == null || x.key < min.key)
		{
			min = x;
		}
	}
/**
	 * Decreases the key value for a heap node, given the new value to take on.
	 * The structure of the heap may be changed and will not be consolidated.
	 * 
	 * <p>
	 * Running time: O(1) amortized
	 * </p>
	 * 
	 * @param x Node whose value should be decreased.
	 * @param k New key value for node x.
	 * 
	 * @exception IllegalArgumentException
	 *                Thrown if k is larger than x.key value.
	 */
Decreases the key value for a heap node, given the new value to take on.
The structure of the heap may be changed and will not be consolidated.



@param x Node whose value should be decreased.
@param k New key value for node x.

@exception IllegalArgumentException
Thrown if k is larger than x.key value.
Decreases the key value for a heap node given the new value to take on . The structure of the heap may be changed and will not be consolidated . @param x Node whose value should be decreased . @param k New key value for node x . @exception IllegalArgumentException Thrown if k is larger than x . key value .
public void decreaseKey(Node x, double k)
	{
		if (k > x.key)
		{
			throw new IllegalArgumentException(
					"decreaseKey() got larger key value");
		}
		x.key = k;
		Node y = x.parent;
		if ((y != null) && (x.key < y.key))
		{
			cut(x, y);
			cascadingCut(y);
		}
		if (min == null || x.key < min.key)
		{
			min = x;
		}
	}
public void decreaseKey ( Node x , double k ) { if ( k > x . key ) { throw new IllegalArgumentException ( "decreaseKey() got larger key value" ) ; } x . key = k ; Node y = x . parent ; if ( ( y != null ) && ( x . key < y . key ) ) { cut ( x , y ) ; cascadingCut ( y ) ; } if ( min == null || x . key < min . key ) { min = x ; } }
Decreases the key value for a heap node, given the new value to take on.
Decreases the key value for a heap node given the new value to take on .