Draw a 5-node network with capacity
Chapter 8, Problem 8.4.4(choose chapter or problem)
Draw a 5-node network with capacity |i j| between node i and node j. Find the largest possible flow from node 1 to node 4.
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