Motivational Assignment

Section 6.3

Group Members



Close your books for this exercise! You will hand in your work from this exercise (next Tuesday); the problems assigned for this section will be due a week from Thursday.

Given: a simple, connected graph with positive weights, such as that shown below:

  1. Create: an algorithm to find the shortest path (in the sense of least weight) between two nodes (such as x and y).
  2. Demonstrate: how to use your algorithm on this graph.
  3. Reflect: how does your algorithm compare to those described in the text? Does your algorithm work? If so, does it work well? If not, what went wrong?
Website maintained by Andy Long. Comments appreciated.