What is the weight of a minimum spanning tree of the following graph?
Apply Prim's algorithm, start from $A$ as shown in figure below.
Add all the weights in the given figure which will be equal to $31$.
Correct Answer: $B$
@techbd123
Can you please see my above comment.
@`JEET
Please check it.
Use kruskals algorithm
31 is the answer
64.3k questions
77.9k answers
244k comments
80.0k users