Homework 4 Correction

We need to issue a correction for Homework 4. Problem 2(c)ii. originally defined edge contraction so that if we end up with parallel edges after identifying the edge's endpoints, we remove all but the lightest edge between any two nodes. While this description is fine for algorithms involving minimum spanning trees, it is not the right operation to use for computing bottleneck distance (or maximum spanning trees).

Instead, we should remove all but the heaviest edge. Both the definition given for edge contraction and Figure 2 in the homework pdf have been updated with this correction.