Vidyalelo
Data Structure · Q84

Graphs

Programming · Data Structure · question 84

Q84

Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?

A.
add all values by 10
B.
subtract 10 from all the values
C.
multiply all values by 10
Answer
D.
in both the cases of multiplying and adding by 10

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board