nodes must be linked with each other of coursethe node with the smaller key becomes the parent of the other as result of the link operation and step remove node from the root list of step make the parent of so if need ariseswe exchange the pointers to ptr step increment the degree of and temp step set mark[yfalse nextwe link temp to ptr using the link_fibstep end heap procedure the link_fib-heap procedure (fig increments the degree of but leaves figure algorithm to link two fibonacci heaps the degree of unchanged since node is no longer rootthe pointer to it in array is removed in step note that the value of degree of is incremented in the link_fib-heap procedureso step restores the value of degree[xthe while loop is repeated until [dnullthat is until no other root with the same degree as exists in the root list of link_fib-heap (hxyexample remove the minimum node from the fibonacci heap given below min[ min[ (step temp ptr temp ptr temp (step (step temp temp ptr ptr ptr ptr ptr temp temp (step (step (step (step min[ fibonacci heap (step ptr figure (step (step (step ptr (step ptr ptr (step temp