Dijkstras algorithm is a graph algorithm to determine the shortest path from a specied vertex to every

No answer yet for this question. Ask a Tutor

Question:

Dijkstras algorithm is a graph algorithm to determine the shortest path from a speciﬁed vertex to every other vertex in a weighted graph. Recall that it builds a tree of shortest paths from the speciﬁed vertex one edge at a time. For the graph below with speciﬁed 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.

捕获.PNG