MadeEasy Test Series: Algorithms - Graph Algorithms

Question

Comments

$E_{max}$ is shortest distance from source vertex to every other vertex in the given graph but not dijkstras graph.

---

Lets consider vertex D and S,the shortest distance from M to D is 6 and M to S is 7.Will we add 6+7 to Emax for this,or will we add 1+5+1(Because this is the cost of all edges which shows shortest distance from M to vertex S and D).

I hope question is cleared.

 

The question says cost of all edges which shows shortest distance from M to all other vertex ,so we will ad tll the edge cost involved in Dijakstra graph?

Please help in understanding this statement

---

I also did the same...

Answer 1

M-A = 1

M-E1=2

M-D=6

M-A1=3

M-S=7

M-E=8

M-Y=9

M-S1=10

M-C=12

hence the value of emax is sum of all these which is 58.

Minimum spaning tree cost is 40 so emax-esp= 58-18

40

Correct me I wrong .