If the Ford-Fulkerson algorithm stops without reaching t.
Chapter 23, Problem 23.7(choose chapter or problem)
If the Ford-Fulkerson algorithm stops without reaching t. sho~ that the edges with one end labeled and the other end unlabeled form a cut set (S. T) whose capacity equals the maximum flow.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer