Problem 2. Consider the following undirected weighted graph: A 5 E 10 BO 27 OF 8 C 11 G 12 D H Assuming that ties are br

[answerhappygod]

Problem 2 Consider The Following Undirected Weighted Graph A 5 E 10 Bo 27 Of 8 C 11 G 12 D H Assuming That Ties Are Br 1 (71.29 KiB) Viewed 35 times

Problem 2. Consider the following undirected weighted graph: A 5 E 10 BO 27 OF 8 C 11 G 12 D H Assuming that ties are broken lexicographically, your task is to: a) Compute the shortest path tree T starting from the vertex A. List the edges in T. b) List the order in which the vertices are processed by Dijkstra's algorithm, i.e., the order in which they're extracted from the priority queue. (You do not have to explain your answer.) [7 marks [3 marks]