notes here is the algorithm let be the set of all the vertices of the graph and be the set of all the vertices considered for the determination of the minimal path set ={ while there are still vertices in (asort the vertices in according to the current best estimate of their distance from the source (badd uthe closest vertex in sto (cre-compute the distances for the vertices in (dconsider the following example for illustration find the shortest path from node to node in the following graph label on an edge indicates the distance between the two nodes the edge connects applying dijkstra algorithm {xdistances of all the nodes from the nodes in the sxa xb xc xd xe xy sinceminimum distance from to - is (xb) {xband {xb distances of all the nodes from the nodes in the sxa xc xd xe xy xba xbc xbd xbe xby sinceminimum distance from to is (xby) {xbyand {xby distances of all the nodes from the nodes in the sxa xc xd xe xba xbc xbd xbe xbya xbyc xbyd xbye continuing in similar mannerwe find that the shortest path between nodes and is xby with cost value lovely professional university