Algorithms | Graph Shortest Paths | Question 8 (original) (raw)
In a weighted graph, assume that the shortest path from a source 's' to a destination 't' is correctly calculated using a shortest path algorithm. Is the following statement true? If we increase weight of every edge by 1, the shortest path always remains same.
This question is part of this quiz :
Share your thoughts in the comments