If the Ford–Fulkerson algorithm stops without reaching t, show that the edges with one end labeled and the other end unlabeled form a cut set (S, T) whose capacity equals the maximum flow.
Chapter 23, PROBLEM SET 23.7 #14
If the Ford–Fulkerson algorithm stops without reaching t, show that the edges with one end labeled and the other end unlabeled form a cut set (S, T) whose capacity equals the maximum flow.
This problem has been solved!
Do you need an answer to a question different from the above? Ask your question!
Related Book For 
PROBLEM SET 23.2:
PROBLEM SET 23.4:
PROBLEM SET 23.5:
PROBLEM SET 23.6:
PROBLEM SET 23.7:
PROBLEM SET 23.8: