The picture above (worksheet 33) is "Use Dijkstras Algorithm to find a shortest weighted path from vertex D to vertex F"

Questions:

1. Use Dijkstras Algorithm to find a shortest weighted path from vertex A to every other vertex. Imitate what we did on Classroom Worksheet 33 (on my web page).

2. Draw the tree of parents and weights and shortest paths from A to every other vertex.

34 36 24 35 42 18 39 25 19 65 23 12 21 30 Step | current Distances D Parents P Still-to-search Q adj(v) n Q vertex v Dpi-0 | PD]-D?A,B,C,D,E,F,G,H,I] D[A-12PAD DE-33 PE-D A,B,C,E,F,G,H,1] | ???? DI-30PU-D A,B,E,F,G,HI A,B,E,F DF-46PF B,E,F,G,H,? B) DBl-34 PIB-A 4 [B,E,F,G,H G,H