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

The Gateway to Computer Science Excellence

+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

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,741 questions

57,251 answers

198,058 comments

104,685 users