Question

Question 6 Let G be the weighted graph (a) Use Dijkstra's algorithm to find the shortest path from A to F. You can do all the work on a single diagram, but, to show that you have used the algorithm correctly, if an annotation needs updating do not erase itjust put a line through it and write the new annotation above that b) In what order are the vertices added to the tree? (c) Notice that the algorithm does not, in this instance, generate a spanning tree. Which vertex or vertices are missing? d) Extend the use of the algorithm until the shortest distance from A to each other vertex is established, and a spanning tree is thereby generated. Draw this tree (e) Is the spanning tree you have generated using Dijkstra's algorithm a minimal spanning tree? Justify your answer

Answer 1

Ca) VERTEX PREVIOUS VERTEX SHORTEST DIST. FROM A 0 レーE p 12 5 A, 3 Step 2 Find ae nocles conneceed to cesnrent Step 3Fom cach nade connected, sind the nero diskance adding cerent disan na of node comecteothen the value

Step s the odet b The onde 口.rithm does nof- genera d) Ex te Spamming 5 C3) B) (4) 1 2 2. Ce he s 2)