Home Forums Algorithms Fibonacci heaps: up-heap procedure for the decrease-key operation

This topic contains 1 reply, has 1 voice, and was last updated by  Leprofesseur } 10 months ago.

Viewing 2 posts - 1 through 2 (of 2 total)
  • Author
    Posts
  • #2759

    Leprofesseur }
    Keymaster

    Why can’t we use upheap procedure for the decrease-key operation as we are always assuming that the new key is always lesser than the current one?

    #2760

    Leprofesseur }
    Keymaster

    Upheap process involves comparing child nodes with parents, if value is less than the parent, then switch the nodes, and continue. Decrease-key is similar process. Do not confuse with terminology, You still need to apply some algorithm to achieve the goal. In the lecture a basic procedure is explained, you may always apply a better algorithm.

Viewing 2 posts - 1 through 2 (of 2 total)

You must be logged in to reply to this topic.