void function ( FibonacciHeapNode < T > arg0 , FibonacciHeapNode < T > 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 = minNode ; arg0 . right = minNode . right ; minNode . 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 FibonacciHeapNode<T> minNode concode_elem_sep double oneOverLogPhi concode_elem_sep int nNodes concode_field_sep FibonacciHeapNode<T> removeMin concode_elem_sep void consolidate concode_elem_sep boolean isEmpty concode_elem_sep void clear concode_elem_sep void link concode_elem_sep void insert concode_elem_sep void decreaseKey concode_elem_sep void cascadingCut concode_elem_sep FibonacciHeap<T> union concode_elem_sep void delete concode_elem_sep FibonacciHeapNode<T> min concode_elem_sep int size concode_elem_sep String toString