Project 1 - Dynamic Programming TSP

Due: Oct 29 (T), 2002

Implement a dynamic programming version of TSP as outlined by Algorithm 3.11 of the text.

The difficulty in implementing this algorithm is that the second array subscript is a set. However, if you implement the set as a bit-vector as discussed in class, then you can think of it as an integer and a set. Thus, the matrices D and P do actually correspond to two-dimensional arrays.