Algorithms | Graph Minimum Spanning Tree | Question 4

Last Updated :
Discuss
Comments

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?

7

8

9

10

This question is part of this quiz :

Top MCQs on Minimum Spanning Tree (MST) in Graphs with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy