#Totally Confused# please tell Using Dijkstra Algorithm solve shortest path algorithm from A to D.

Question

Using DIjkstra algorithm solve shortest path algorithm from A to D 

Answer 1

please have a check,if it is clear

answer is 11

Comments

Yes, Two Path Are possible here with Edge Weight of 11.

1. A->C->D

2. A->F->G->D

---

In The Solution above... the Order of Deletion should Be: A,B,E,F,G,C,D and not the above mentioned. Please Correct it If You want....  (-_-)

---

Solution submitted by @Arnab Bhadra is the correct Dijkstra's soln.....

and shortest path can be A---->F---->G---->D  having weight 11.