value for [zusing the edge ( ,zthe specific edge relaxation operation is as followsedge relaxationif [ + (( , ) [zthen [ ]- [ ]+ (( , )we give the pseudo-code for dijkstra' algorithm in code fragment note that we use priority queue to store the vertices outside of the cloud code fragment dijkstra' algorithm for the single-source shortest path problem we illustrate several iterations of dijkstra' algorithm in figures and figure an execution of dijkstra' algorithm on weighted graph the start vertex is bwi box next to each vertex stores the label [vthe symbol is used instead of the edges of the shortest-path tree are drawn as thick blue arrowsand for each vertex outside the "cloudwe show the current best