Below are a few really minor updates about Lab 4.  If you have any
questions, just let me know.  I expect most of you have already taken
care of these.  Each change can be very easily made.  However, if you
prefer to get a new copy of the provided driver, it has been updated
on the web page.

  By now I hope most of you are well on your way to having this lab
completed.  Don't forget about our office hours.  Here's the hours that
we will have between now and when lab 4 is due:

	Friday November 19,  11:30-1:00am in Lopata 406
	Sunday November 21,  7-11pm in Lopata 406
        Monday November 22,  1-2pm in Jolley 538
        Monday November 22,  7-9pm in Lopata 406
        Tuesday November 23,  HELP SESSION after class in Jolley 538 (or 542)

        NOTE: there will not be hours on Tuesday night or Wednesday unless we get
              an explicit request to hold them

        Sunday November 28, 7-11pm in Lopata 406
        Monday November 29, 1-2pm in Jolley 538
        Monday November 29, 7-9pm in Lopata 406


Here are the minor updates for Lab 4:

 o The class defined within BinaryHeapTester.java was just called "Test".
    I updated this so that the class is called "BinaryHeapTester".  If you
    instead changed the filename to Test.java that is also fine.

 o The driver used minKey() versus minimumKey() as given in the specification.
    I updated the driver to now use minimumKey().  However, if instead you
    called the method minKey() that is just fine.

 o In the specification given in the lab decreaseKey was to take a third
    parameter which is the new data.  However, the provided driver just
    sends two parameters, the handle and new key.  It is your choice
    whether or not you want the third parameter, the new data, to be
    included.  The pseudocode given in class for Prim's algorithm and 
    Dijkstra's algorithm assumed that there was not the third parameter 
    and then if decreaseKey returns true it can update the data.  It is
    trivially modified to have the new data included as a parameter. 
    Again, you may choose whether or not decreaseKey takes the new
    data as a third parameter. If you want to have the third parameter
    then you can update BinaryHeapTester to include a third argument in
    the call to decreaseKey.  

 o In the Java driver, the parameter passed giving the size of the heap was 21
    eventhough only 5 elements were placed in the heap.  The "21" could be
    replaced by "5" but it shouldn't matter, it just means that the array is
    allocated larger than needed.  In your implementation of Prim/Dijkstra's
    algorithm, please make the heap the size you need (i.e. the number
    of vertices in the graph) --- Don't oversize it.