Question

find the minimum cost spanning tree on the graph above using kruskals algorithm. which of the edges below are included in the minimum cost tree?
□ ad
□ ab
□ ac
□ bd
□ cd
□ bc

Explanation:

Step1: List edge - weights

AD = 8, AB = 12, AC = 9, BD = 4, CD = 6, BC = 14

Step2: Sort edges by weight

BD (4), CD (6), AD (8), AC (9), AB (12), BC (14)

Step3: Apply Kruskal's algorithm

Add edges in sorted order without creating cycles. First add BD. Then add CD. Then add AD.

Answer:

AD, BD, CD