# Gate 2016 [closed]

135 views
Let G be aweighted 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 notchange
Q: Shortest path between any pair of vertices doesnot change
(A) P only
(B) Q only
(C) NeitherPnorQ
(D) Both PandQ

why not D ,I think Shortest path between any pair of vertices will also not change.
closed as a duplicate of: GATE2016-1-14

closed

## Related questions

1
504 views
If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, then, What will be the time complexity to compute the minimum cost spanning tree given that union and find operations take amortized O(1) ? A O(m logn) B O(n) C O(m) D O(n logm)
Source of the question - here A sink in a directed graph is a vertex i such that there is an edge from every vertex $j ≠ i$ to i and there is no edge from i to any other vertex. A directed graph G with n vertices is represented by its adjacency matrix A, where ... sink as all the diagonal elements in adjacency matrix is = 0. You can take a Graph with 4 vertices and make anyone of them as a sink.