Let P be the shortest path from S to T. If the weight of every e

Let P be the shortest path from S to T. If the weight of every edge in the graph is incremented by 2, P will still be the shortest path from S to T. ~@[](2)

答案：FALSE