Texts:
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 parentheses and quotes from the operations when you write them. Here are the first few lines of your answer to get you started:
1. add(A, 0)
2. pop(A)
3. add(B, 3)
4. add(E, 9)
12
19
23
B
E
9
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 parentheses and quotes from the operations when you write them. Here are the first few lines of your answer to get you started:
1. add(A, 0)
2. pop(A)
3. add(B, 3)