Assignment 12

Due Monday, 4/22/96.

Chapter 7: 42, 43, 44, 45
Neither of the following problems is to be turned in:

  1. Explain how to modify the all-pairs-shortest-paths algorithm to obtain the shortest path from i to j. Include a procedure to print out the shortest path.
  2. Rewrite the N-Queens algorithm iteratively (i.e., no recursion). Your algorithm should NOT use a stack.