Homework 6 - Djkstra's and MSTs

The homework is due at the start of class on Tuesday, May 12.
    Homework problems:
  1. Problem 4.8 from [DPV] (variant of Dijkstra's for negative weights?)
  2. Problem 5.9, parts a to i from [DPV] (unique heaviest edge) (3 points)
  3. Problem 3.22 from [DPV] (is there a v from which can reach every other vertex)
    Practice problems (don't turn in):
  1. Problem 5.1 from [DPV]
  2. Problem 5.2(a) from [DPV]
  3. Problem 5.11 from [DPV] (union-find data structure), you do not need to use path compression, which we didn't cover in class.