Evaluations for input
Input | Output |
|---|---|
 Consider the following graph:Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal's algorithm?<image 1> (A) (a-b),(d-f),(b-f),(d-c),(d-e) (B) (a-b),(d-f),(d-c),(b-f),(d-e) (C) (d-f),(a-b),(d-c),(b-f),(d-e) (D) (d-f),(a-b),(b-f),(d-e),(d-c) Answer with the option's letter from the given choices directly. No punctuation. | (B) Expected Answer: D Difficulty: Hard Subfield: Data Structure and Algorithm Explanation: The edge (d-e) cannot be considered before (d-c) in Kruskal's minimum spanning tree algorithm because Kruskal's algorithm picks the edge with minimum weight from the current set of edges at each step. |
Consider the following graph:Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal's algorithm?<image 1> (A) (a-b),(d-f),(b-f),(d-c),(d-e) (B) (a-b),(d-f),(d-c),(b-f),(d-e) (C) (d-f),(a-b),(d-c),(b-f),(d-e) (D) (d-f),(a-b),(b-f),(d-e),(d-c) Answer with the option's letter from the given choices directly. No punctuation. | A Expected Answer: D Difficulty: Hard Subfield: Data Structure and Algorithm Explanation: The edge (d-e) cannot be considered before (d-c) in Kruskal's minimum spanning tree algorithm because Kruskal's algorithm picks the edge with minimum weight from the current set of edges at each step. |
Rows per page
Input
- Input ID
- 2307cc54-7e6f-494f-aed8-77b552a7d1eb
- Created
- February 13, 2024
- Permission
- Public