Question $24.$

We apply Dijkstra's algorithm to find the shortest path between two nodes in an undirected,

weighted graph with all positive edge weights. We found the shortest distance between nodes

named Source and Destination is N$.$ Now, if we multiply all edge weights in the graph by $M,$ what

will be the new shortest path distance between the nodes Source and Destination?

May is not $N_{,}"M$ but less than or equal :

$N^{**}M$

greater than $N^{**}M$

Transcribed Image Text:

Question 24. F 18 Finish 19 Q Search 20 21 22 We apply Dijkstra's algorithm to find the shortest path between two nodes in an undirected, weighted graph with all positive edge weights. We found the shortest distance between nodes named Source and Destination is N. Now, if we multiply all edge weights in the graph by M, what will be the new shortest path distance between the nodes Source and Destination? O Question Time Left 55 sec Total Marks: 20 Answer: 25 O May is not N,"M but less than or equal to O N*M O can't be said without recalculate O greater than N*M Team ID: 835650-U7RN59B5 Question 24. F 18 Finish 19 Q Search 20 21 22 We apply Dijkstra's algorithm to find the shortest path between two nodes in an undirected, weighted graph with all positive edge weights. We found the shortest distance between nodes named Source and Destination is N. Now, if we multiply all edge weights in the graph by M, what will be the new shortest path distance between the nodes Source and Destination? O Question Time Left 55 sec Total Marks: 20 Answer: 25 O May is not N,"M but less than or equal to O N*M O can't be said without recalculate O greater than N*M Team ID: 835650-U7RN59B5

Answer rating: 100% (QA)

The question is about the effect of scaling all edge weights in a graph by a constant factor on the ... View the full answer