Discrete Math - Dijkstra's Algorithm

Use Dijkstras algorithm to find the shortest path from a to z. In each case make tables similar to Table 10.7.1 to show the action of the algorithm.

15. PLEASE SOLVE THIS: The graph of exercise 9 (shown above) with a = a and z = f

Note: Please include the table similar to the following format in the answer.

11 |10 f 12--- C0 0d C1 7/ 7-1 2 all-4 4 | 35 3 a 4 9