Answer: A

Shortest path may change.

Shortest path may change.

Dark Mode

301 views

0 votes

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

- P only
- Q only
- Neither P nor Q
- Both P and Q

0 votes