(a) Prim's algorithm starts at vertex A on the graph shown below. Show and describe that state of the data structures after the 6-th edge has been added to the MST:
List the 6 edges, plus their weight,in the order they were added to the mst.
. List the vertices in the priority queue PQ along with their weight (after the 6-th edge has been added).
Finally, state the order of the remaining edges chosen
(b) List the weights of the MST edges in the order that Kruskal's algorithm adds them to the MST.
c) Suppose that we run Dijkstra's shortest path algorithm starting at vertex G. List the weights of the edges in the shortest path tree in the order that they are added.
130
110
0
20
140
120
150
90
100
E
30
10
40
80
70
60
50
R
Figure 2: Weighted Graph