EE 644 Spring 2002
Homework 5

• Due 4/5 (friday)
• Problems: Textbook problems:
  • 5.1 (2 pts)
  • 5.2 (1pt), but only for Dijkstra's algorithm
  • 5.3 (1 pt)
  • 5.4 (1 pt)
  • 5.10 (2 pts). Hint for part (a): those nodes that won't change their D values should be included in P. Hint for part (b): Think of the paths that are affected by the change.