In a directed weighted graph, if the weight of every edge is decreased by 10 units, does any change occur to the shortest path in the modified graph?
(a) 209
(b) 65
(c) 57
(d) 43
This question was addressed to me in an interview.
My question is based upon Different Path in a Graph topic in section Graphs of Discrete Mathematics