The problem numbers refer to the textbook on Jeff Erickson's algorithms page.
  1. Exercise 11 of Chapter 5 (Basic Graph Algorithms). (10 points)
  2. Exercise 13 of Chapter 5. (10 points)
  3. Exercise 17 of Chapter 8 (Shortest Paths). (10 points)
  4. Exercise 24 of Chapter 8. (10 points)

The homework is due in class on Thursday, April 4. Please pay attention to the policy on collaboration outlined in the syllabus.