Algorithms | Graph Minimum Spanning Tree | Question 3

Last Updated :
Discuss
Comments

Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight of the edge {i, j}. What is the minimum possible weight of a spanning tree T in this graph such that vertex 0 is a leaf node in the tree T? (GATE CS 2010)
2010

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