This preview shows page 1. Sign up to view the full content.
Unformatted text preview: traditional "salesman" term for this problem.) A Shortest-Path Algorithm (page 224 in Discrete Source or page 351 in Discrete Mathematics): In the following three exercises, also list the explored (i.e., circled) vertices, in the order in which the algorithm adds them. Note that doing #2 and #3 together saves some work. * Exercise 2. * Exercise 3. * Exercise 5. There is a supplementary webpage on Complexity of Decision Problems....
View Full Document
- Fall '08