(Solved): Please explain your method and your reasoning 1. Calculate the shortest distance between vertices ...

Expert Answer

---

we have to find the shortest distance to reach F vertex from A vertex,
so we have to use dijkstra's method to to find shortest path,
the logical aproch is to sind that
i,e

if { d(u)+c(u,v) d(v)= d(u)+c(u,v)


d(u)=distance to vertex,



c(u,v)=cost of the edge



in the above graph vertex A connected to two vertex named C,B
applying in the above formula,

and first we have to assume that the connected vertex's distance is infinite.
so
  
now finding distance from A to B,
if


it was satisfied so,

We have an Answer from Expert

Buy This Answer $5

Place Order