Consider the following matrix for a weighted graph; in what order will Kruskal’s add edges to the MST? a b c d e f g ha 0 8 0 0 0 0 0 0b 8 0 4 2 0 0 0 0c 0 4 0 11 0 3 0 0d 0 2 11 0 5 6 10 0e 0 0 0 5 0 0 0 0f 0 0 3 6 0 0 0 7g 0 0 0 10 0 0 0 9h 0 0 0 0 0 7 9 0(A) b-d b-c d-e c-f f-h a-b g-h(B) c-f b-d b-c d-e f-h a-b g-h(C) b-d c-f b-c d-e f-h a-b g-h(D) b-d c-f b-c d-e g-h f-h a-b

Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

1.	Consider the following matrix for a weighted graph; in what order will Kruskal’s add edges to the MST? a b c d e f g ha 0 8 0 0 0 0 0 0b 8 0 4 2 0 0 0 0c 0 4 0 11 0 3 0 0d 0 2 11 0 5 6 10 0e 0 0 0 5 0 0 0 0f 0 0 3 6 0 0 0 7g 0 0 0 10 0 0 0 9h 0 0 0 0 0 7 9 0(A) b-d, b-c, d-e, c-f, f-h, a-b, g-h(B) c-f, b-d, b-c, d-e, f-h, a-b, g-h(C) b-d, c-f, b-c, d-e, f-h, a-b, g-h(D) b-d, c-f, b-c, d-e, g-h, f-h, a-b
Answer»

Discussion