EE 644 Spring 2002
Homework 6

• Due 4/12 (friday)
• Problems: Textbook problems:
  • 5.24 (2 pts)
  • 5.25 (1 pt)
  • 5.26 (2 pt). For part (b) just do five iterations of the algorithm.
  • 5.31 (3 pts).
  • Problem A. (1 pt) Apply the Bellman-Ford algorithm to find the shortest path tree for the graph in Figure 5.73 on page 479 in the textbook. Note that algorithm should produce shortest paths from a single source to all the othernodes. The source node is the one in the upper left hand corner. In addition, show all the D values for each value of h.