GATE | GATE CS 2010 | Question 51
In the graph given in above question, what is the minimum possible weight of a path P from vertex 1 to vertex 2 in this graph such that P contains at most 3 edges?
(A) 7
(B) 8
(C) 9
(D) 10
Answer: (B)
Explanation: See question 2Â https://www.geeksforgeeks.org/data-structures-and-algorithms-set-25/
Quiz of this Question
Last Updated :
28 Jun, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...