Let G be a weighted connected undirected graph with distinct positive edge…
PYQ GATE 2016
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE?
P: Minimum spanning tree of G does not change
Q: Shortest path between any pair of vertices does not change
- A.
P only
- B.
Q only
- C.
Neither P nor Q
- D.
Both P and Q
Attempted by 421 students.
Sign up free to check your answer
Sign up freeLoading lesson…