#self doubt #greedy method #testseries

Question

Consider the multistage graph with 6 stages then what is the minimum cost from Source node (A) to Destination node (N) using Greedy Method ______

 

Comments

hmm good question

---

I am confused with Dijkstra's algo here, when we have selected A-E=1, then we have two possibilities for going forward either A-B or E-H since both gives 2 , then why only E-H is chosen? How are we working here in case a specific destination is given???

---

We use Dijkstra Algorithm to find out the single source shortest path from source to each and every other node .

But when we are talking about multistage graph, then it simply means the shortest distance from source to the destination and while doing that we may get shortest distance to every other node or may not.

and regarding what you said,if you have reached to E and you are standing there, then using dijkstra the weight of E is 1 and weight of B,C,D are 2,4,3 so as of dijkstra,we will definitely choose the node with lowest weight node i.e E and then we will relax the outgoing edge of the E node.