please..take the required portion of screen and upload it again :)

1 vote

0

nothing special about it. we have to run Dijkstra on this graph and find out all shortest path costs : add them then minus $7$

0

I did it in similar way.The path from M to S has cost as 7.

But the parameter EMax,I have added all the edge wait that were included by dijakstra and i got 22 ,but in the solution they have added each vertex cost instead of edge cost. and they got 58-7 as answer where as i got 22-7 as answer.

Am i understansing it incorrect ?

But the parameter EMax,I have added all the edge wait that were included by dijakstra and i got 22 ,but in the solution they have added each vertex cost instead of edge cost. and they got 58-7 as answer where as i got 22-7 as answer.

Am i understansing it incorrect ?

0

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

0

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 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