Dijkstra Algorithm

Question

I think answer should be Option(B).

Path:<s,y><y,x><x,t> = 7-3-2=2

Comments

@Magma

can you check this

 

---

yeah correct

I did mistake ....that time

---

Thanks, Brother, you clear my doubts.

Answer 1

According to dijkstra's algorithm, we will get shortest path as 6 which is a direct edge from s -> t.

There are only two direct edge from s  i.e  s -> t  with weight  6  and  s ->y  with weight 7 ,out of which 6 is minimum.

So, it will be selected in the first iteration itself.

Hence, Answer is 6

Note:- But manually if we calculate,we can get the shortest path as 2. So, we can consider this example to show that why dijkstra algorithm fails for the negative weighted edges.

Comments

You have to relax all the edges can you please check it once again.
@arjun sir can you help with this.

---

@Arpit

What you mean by relaxing the edges?

---

https://stackoverflow.com/questions/12782431/relaxation-of-an-edge-in-dijkstras-algorithm

Answer 2

A(6) will be answer.

Answer 3

It will be 2 in Bellman Ford but correct in 6 THrough Dijkastra algorithm