src/main/java/com/mxgraph/analysis/mxFibonacciHeap.java
protected void cascadingCut(Node y)
	{
		Node z = y.parent;

		// if there's a parent...
		if (z != null)
		{
			// if y is unmarked, set it marked
			if (!y.mark)
			{
				y.mark = true;
			}
			else
			{
				// it's marked, cut it from parent
				cut(y, z);

				// cut its parent as well
				cascadingCut(z);
			}
		}
	}
/**
	 * Performs a cascading cut operation. This cuts y from its parent and then
	 * does the same for its parent, and so on up the tree.
	 * 
	 * <p>
	 * Running time: O(log n); O(1) excluding the recursion
	 * </p>
	 * 
	 * @param y The node to perform cascading cut on.
	 */
Performs a cascading cut operation. This cuts y from its parent and then
does the same for its parent, and so on up the tree.



@param y The node to perform cascading cut on.
Performs a cascading cut operation . This cuts y from its parent and then does the same for its parent and so on up the tree . @param y The node to perform cascading cut on .
protected void cascadingCut(Node y)
	{
		Node z = y.parent;
		if (z != null)
		{
			if (!y.mark)
			{
				y.mark = true;
			}
			else
			{
				cut(y, z);
				cascadingCut(z);
			}
		}
	}
protected void cascadingCut ( Node y ) { Node z = y . parent ; if ( z != null ) { if ( ! y . mark ) { y . mark = true ; } else { cut ( y , z ) ; cascadingCut ( z ) ; } } }
Performs a cascading cut operation.
Performs a cascading cut operation .
// if there's a parent... // if y is unmarked, set it marked // it's marked, cut it from parent // cut its parent as well