CS 161 - Algorithms Homework 5, 25 Points
Due: Friday, November 16, 2012

  1. 5 points. Problem R-6.8 from Goodrich-Tamassia.
  2. 5 points. Problem R-6.13 from Goodrich-Tamassia.
  3. 5 points. Problem C-6.9 from Goodrich-Tamassia.
  4. 5 points. Problem C-6.13 from Goodrich-Tamassia.
  5. 5 points. Describe how to implement Dijkstra's algorithm to run in O(n2) time, e.g., by using an adjacency matrix instead of adjacency list.