Use Dijkstras algorithm to find the shortest path between ve

Use Dijkstra\'s algorithm to find the shortest path between vertices A and H. Show each step of the calculations.

Solution

We start labeling the vertices from A. A is labled (-,0). Next, E is labeled (A,6). Then D is labeled (A,7) and B is labeled (A,9). Next, G is labeled (E,15) and C is labeled (B,19) then F is labeled (G,23). Then H is labeled (G,28). Therefore,the shortest path between the vertices A and H is, AEGH=23