Assume that path P is the shortest path between vertex v and vertex u in a directed graph. If we increase the weight of every edge in the graph by $1,$ then path P will not necessary be the shortest path

Select one:

True

False