Answer Happy

Question 1: Dijkstra's Algorithm Given the following graph, please answer the following two questions. Always assume that the vertex, A, is the source node. A 2 D 3 G 5 B H E F (1a) (7 points) Please list the order that nodes are removed from the priority queue if using Dijkstra's algorithm to find all shortest paths from the source node, A. A has been provided for you, as it's the first node that will be removed from the priority queue. Assume that ties are broken alphabetically (so, if E and F were tied in terms of priority, E would be given more priority than F). Solution: A,. 10 2