2 rows

Input | Output |
---|---|

Given the adjacency matrix of a weighted undirected graph as follows, the total weight of its minimum spanning tree is:<image 1> (A) 22 (B) 20 (C) 15 (D) 8 Answer with the option's letter from the given choices directly. No punctuation. | 22 Expected Answer: D Difficulty: Medium Subfield: Data Structure and Algorithm |

Given the adjacency matrix of a weighted undirected graph as follows, the total weight of its minimum spanning tree is:<image 1> (A) 22 (B) 20 (C) 15 (D) 8 Answer with the option's letter from the given choices directly. No punctuation. | C Expected Answer: D Difficulty: Medium Subfield: Data Structure and Algorithm |

Rows per page

Page 1 of 1

- Input ID
- f0885495-954b-4b58-b20f-94773f9d72b0
- Created
- February 13, 2024
- Permission
- Public