Question discussion

A weighted graph has the edges (A,B,4), (A,C,2), (B,C,1), (B,D,5), (C,D,8), (C,E,10), (D,E,2). What is the weight of its minimum spanning t…

A weighted graph has the edges (A,B,4), (A,C,2), (B,C,1), (B,D,5), (C,D,8), (C,E,10), (D,E,2). What is the weight of its minimum spanning tree?

Correct answer: A

Explanation

Kruskal picks B–C (1), A–C (2), D–E (2) and B–D (5), giving 1 + 2 + 2 + 5 = 10.

Nobody has replied yet. Start the discussion!