Q43
In the context of graph algorithms, what is a "cut"?
A.
A complete traversal of all nodes.
B.
A partition of the vertices into two disjoint subsets.
AnswerC.
A method to count the number of vertices.
D.
A complete traversal of all nodes.
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board