Vidyalelo
Data Structure · Q28

Graphs

Programming · Data Structure · question 28

Q28

What is the significance of the "cut" in the context of the Max-Flow Min-Cut Theorem?

A.
It is the total weight of all edges.
B.
It represents the number of cycles in the graph.
C.
It represents a partition of the vertices into two sets, where the minimum cut is the smallest set of edges that, if removed, would disconnect the source from the sink.
Answer
D.
It represents the number of vertices in the graph.

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board