Consider the following graph. Vertices P, Q, R, S, T with edges (weight): P–Q (30), Q–R (5), Q–S (20), Q–T (15), P–S (40), S–T (10), R–T (25).
Consider the following graph.
Vertices P, Q, R, S, T with edges (weight): P–Q (30), Q–R (5), Q–S (20), Q–T (15), P–S (40), S–T (10), R–T (25).
What is the weight of minimum spanning tree?
Show answerHide answer
Correct answer: (B) 60
Explanation
Kruskal: take Q–R (5), S–T (10), Q–T (15); skip Q–S (20) and R–T (25), which would form cycles; take P–Q (30). Weight = 5 + 10 + 15 + 30 = 60.