Lecture 8: 02/01/2012

Another go at Fibonacci heaps today. We started with the invariants of a Binomial heap as a base to get us started on the invariants of a Fibonacci heap.

We discussed cuts in a Fibonacci heap, and the maximum number of nodes we could cut from a tree so that we don’t have to meld. This is important because we want exponential growth in the trees and we want to keep the rank of each root the same because otherwise we wouldn’t have at most one tree of every rank.

Shout out to Marla for providing us with colored chalk and an exam problem.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s