0 votes 0 votes Algorithms gateforum-test-series algorithms minimum-spanning-tree + – Prince Sindhiya asked Jan 20, 2019 • recategorized Mar 12, 2019 by ajaysoni1924 Prince Sindhiya 655 views answer comment Share Follow See 1 comment See all 1 1 comment reply muthu kumar commented Jan 20, 2019 reply Follow Share Both are false? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Option C Vaibhav Rai answered Jan 20, 2019 Vaibhav Rai comment Share Follow See all 2 Comments See all 2 2 Comments reply Prince Sindhiya commented Jan 20, 2019 reply Follow Share yes u r correct HERE in first one n is no of edges ? or number of vertices 0 votes 0 votes Vaibhav Rai commented Jan 20, 2019 reply Follow Share N is number of vertices. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Answer: C P. False. Weight will increase by $(n-1)*k$ Q. False. Consider the below graph. 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 smsubham answered Dec 16, 2019 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.
