void function ( Node arg0 , Node arg1 ) { arg0 . left . right = arg0 . right ; arg0 . right . left = arg0 . left ; arg1 . degree -- ; if ( arg1 . child == arg0 ) { arg1 . child = arg0 . right ; } if ( arg1 . degree == 0 ) { arg1 . child = null ; } arg0 . left = min ; arg0 . right = min . right ; min . right = arg0 ; arg0 . right . left = arg0 ; arg0 . parent = null ; arg0 . mark = false ; }
the reverse of the link operation : removes x from the child list of y . this method assumes that min is non-null . running time : o 1 concode_field_sep Map<Object,Node> nodes concode_elem_sep Node parent concode_elem_sep Node min concode_elem_sep int size concode_elem_sep Node left concode_elem_sep int degree concode_elem_sep Object userObject concode_elem_sep Node right concode_elem_sep boolean mark concode_elem_sep double key concode_elem_sep Node child concode_field_sep Node removeMin concode_elem_sep double getKey concode_elem_sep void consolidate concode_elem_sep boolean isEmpty concode_elem_sep void link concode_elem_sep void insert concode_elem_sep void decreaseKey concode_elem_sep void cascadingCut concode_elem_sep mxFibonacciHeap union concode_elem_sep void delete concode_elem_sep Object getUserObject concode_elem_sep Node min concode_elem_sep int size concode_elem_sep void setUserObject concode_elem_sep Node getNode