closed by
387 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 2016 Set 1 | Question: 14
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
 

 

answer is a.

why not D ,I think Shortest path between any pair of vertices will also not change.
closed by

Related questions

61 votes
61 votes
5 answers
1
Sandeep Singh asked Feb 12, 2016
28,617 views
Consider the following directed graph:The number of different topological orderings of the vertices of the graph is _____________.
49 votes
49 votes
8 answers
3
0 votes
0 votes
0 answers
4