The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+7 votes

What is the weight of a minimum spanning tree of the following graph?

  1. $29$
  2. $31$
  3. $38$
  4. $41$
asked in Algorithms by Veteran (69k points)
edited by | 896 views

2 Answers

+7 votes
Best answer

Apply Prim's algorithm, start from A as shown in figure below.

add all the weights in the given figure which would be equal to $31$.

answered by Boss (9.3k points)
edited by
yes prims is easier to apply than kruskal here ...
+4 votes
Solution: B

The minimum spanning tree is

answered by Active (1.4k points)
answer is 31

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

33,705 questions
40,252 answers
38,860 users