Essential things to remember from today's class (class 8, 18th September)

The need for a third min-heap operation, to change the priority of an item
   that is already in the heap.

How to implement the adjust-priority operation efficiently.

Exactly how to use a min-heap to find shortest paths.

How to implement heap sort.