A
12
19
23
B
E
3
9
7
4
D
3
Z
9
7
24
4
C
F
a) Write down the shortest path from A to Z in the graph above.
b) Given the graph above, please give the specific sequence of operations used
to find the shortest path from vertex A to vertex Z. Your answer should
be an ordered list of the following operations: add(String vertex,
int priority), pop(String vertex), update(string vertex, int
new_priority), and backchain(). You may omit parenthesis and quotes
from the operations when you write them. Here are the first few lines of
your answer to get you started:
add A, 0
pop A
add B, 3
