Please please answer this question i have only twenty minutes

See Answer

Add Answer +20 Points

Community Answer

See all the answers with 1 Unlock

Get 4 Free Unlocks by registration

Get 4 Free Unlocks by registration

Solution:(1)Frstly, consider the Bare information aboutDijestra's Algorithm:Step. I) set lambda(S)=0 and for all vertices v!=s,lambda(v)=oo set T=V, the vertex set of G.Step-II) Let u be the vertex in T for which lambda(u) is minimum.Step-III) If u=t then stop.step IV) For Every Edge e=uv incident with w if v in T and lambda(v) > x(u)+ure) change the value of lambda(v) tolambda(v)+" wres. "step V :) change T to T-u and ... See the full answer