___________ is a partition of the vertices of a graph in two disjoint subsets that are joined by atleast one edge.
(a) Minimum cut
(b) Maximum flow
(c) Maximum cut
(d) Graph cut
I got this question in a job interview.
My enquiry is from Minimum Cut topic in section Minimum Cut of Data Structures & Algorithms II