Question discussion

For a graph with vertices A–F and weighted edges AB = 4, AC = 2, BC = 1, BD = 5, CD = 8, CE = 10, DE = 2, DF = 6, EF = 3, the weight of a m…

1341Medium DSSSB TGT Computer Science 0 replies 1 views

For a graph with vertices A–F and weighted edges AB = 4, AC = 2, BC = 1, BD = 5, CD = 8, CE = 10, DE = 2, DF = 6, EF = 3, the weight of a minimum spanning tree is

Correct answer: D

Explanation

Kruskal picks BC (1), AC (2), DE (2), EF (3), skips AB (cycle) and takes BD (5): 1 + 2 + 2 + 3 + 5 = 13.

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!