src/main/java/com/mxgraph/analysis/mxFibonacciHeap.java
protected void cut(Node x, Node y)
	{
		// remove x from childlist of y and decrement degree[y]
		x.left.right = x.right;
		x.right.left = x.left;
		y.degree--;

		// reset y.child if necessary
		if (y.child == x)
		{
			y.child = x.right;
		}

		if (y.degree == 0)
		{
			y.child = null;
		}

		// add x to root list of heap
		x.left = min;
		x.right = min.right;
		min.right = x;
		x.right.left = x;

		// set parent[x] to nil
		x.parent = null;

		// set mark[x] to false
		x.mark = false;
	}
/**
	 * The reverse of the link operation: removes x from the child list of y.
	 * This method assumes that min is non-null.
	 * 
	 * <p>
	 * Running time: O(1)
	 * </p>
	 * 
	 * @param x The child of y to be removed from y's child list.
	 * @param y The parent of x about to lose a child.
	 */
The reverse of the link operation: removes x from the child list of y.
This method assumes that min is non-null.



@param x The child of y to be removed from y's child list.
@param y The parent of x about to lose a child.
The reverse of the link operation : removes x from the child list of y . This method assumes that min is non - null . @param x The child of y to be removed from y ' s child list . @param y The parent of x about to lose a child .
protected void cut(Node x, Node y)
	{
		x.left.right = x.right;
		x.right.left = x.left;
		y.degree--;
		if (y.child == x)
		{
			y.child = x.right;
		}
		if (y.degree == 0)
		{
			y.child = null;
		}
		x.left = min;
		x.right = min.right;
		min.right = x;
		x.right.left = x;
		x.parent = null;
		x.mark = false;
	}
protected void cut ( Node x , Node y ) { x . left . right = x . right ; x . right . left = x . left ; y . degree -- ; if ( y . child == x ) { y . child = x . right ; } if ( y . degree == 0 ) { y . child = null ; } x . left = min ; x . right = min . right ; min . right = x ; x . right . left = x ; x . parent = null ; x . mark = false ; }
The reverse of the link operation: removes x from the child list of y.
The reverse of the link operation : removes x from the child list of y .
// remove x from childlist of y and decrement degree[y] // reset y.child if necessary // add x to root list of heap // set parent[x] to nil // set mark[x] to false