Dijkstras algorithm is a graph algorithm to determine the shortest path from a specied vertex to every other vertex in a weighted graph. Recall that

Dijkstras algorithm is a graph algorithm to determine the shortest path from a specified vertex to every other vertex in a weighted graph. Recall that it builds a tree of shortest paths from the specified vertex one edge at a time. For the graph below with specified start vertex E, give the edges (pairs of vertices!) added to the shortest path tree in the order that Dijkstras algorithm adds them to the tree.

 

A B 9 1 E 10 G 4 2 2 D 5 2 8 4 6 H 7 3 7 C 5 F