DT Q28
Common Data for Questions 28 and 29
Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight of the edge {i, j}.
- Option : D
- Explanation : Minimal possible spanning tree having vertex “0”
is a leaf rode is :–
total weight = 4 + 1 + 2 + 3 = 10
Accessibility
Oversized Widget
Saved in this browser. Nothing changes for anyone else.