The Gateway to Computer Science Excellence

Gate 2016 [closed]

0 votes
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
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 as a duplicate of: GATE2016-1-14
in Algorithms by Active (2.4k points)
closed by | 86 views

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,292 answers
104,917 users