Exercises - Lecture 18

18A

  1. What is the length of the shortest path from node 3 to node 6 in the following graph (you don’t need to use Dijkstra’s algorithm)?

    image-20200902174211421

  2. Execute Dijkstra’s algorithm (wihtout backpointers) on the following graph starting from Node A. As I did in the slides, I set up a table to maintain d-values and a place to keep track of the Frontier and Settled sets. Give the final table of d-values as your answer.

    image-20200902184339328

18B

  1. Repeat the previous exercise, but maintain backpointers and start from Node D.