The Gateway to Computer Science Excellence
+1 vote
157 views

in Algorithms by Boss (25.6k points)
edited by | 157 views
0
please..take the required portion of screen and upload it again :)
+1
Updated:)
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 ?
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
0
I also did the same...

1 Answer

0 votes
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 .
by (93 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
198,058 comments
104,685 users