search
Log In
0 votes
159 views

 

in Algorithms
recategorized by
159 views
0
Both are false?

2 Answers

1 vote
Option C
0
yes u r correct

HERE in first one n is no  of edges ? or number of vertices
0
N is number of vertices.
0 votes

Answer: C

P. False. Weight will increase by $(n-1)*k$

Q. False. Consider the below graph.

 enter image description here

MST is

(1)   (4)
  \   /
   (2)
  /   \
(3)   (5)

Shortest path from $1-4$ will be $7$ in MST but it should be $5$.

Reference: https://cs.stackexchange.com/questions/18797/minimum-spanning-tree-vs-shortest-path

 

Related questions

0 votes
0 answers
2
165 views
How many of following are correct statements ? (i) A graph where all edge weights are distinct can have more than one shortest path between two vertices u and v (ii)adding a number w on weight of every edge of graph might change the graph's minimum spanning ... by a positive number might change the shortest path between two vertices u and v (Assume that all edge weights of graph are distinct)
asked Dec 21, 2018 in Algorithms Prince Sindhiya 165 views
...