Show that in a network G with capacities all equal to I,
Chapter 23, Problem 23.7(choose chapter or problem)
Show that in a network G with capacities all equal to I, the capacity of a minimum cut set (S, T) equals the minimum number q of edges whose deletion destroys all directed paths S ~ t. (A directed path v ~ w is a path in which each edge has the direction in which it is traversed in going from v to w.)
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