Using Dijkstra's shortest path algorithm calculate the shortest path fromNode Xthrough toNodeZ in the diagram below. You should clearly show each step of the algorithm.

Find the appropriate weightsusing 20194986 in the following order: abcdefgh. Afterwards, calculate the shortest path from Node X to Node Z using Dijkstra's shortest path algorithm.

 

Transcribed Image Text:

- a c M x N g b Z P K f N - a c M x N g b Z P K f N