Information flow assigns a real-valued amount to every edge in a directed network. Each edge has a capacity, and every intermediate vertex must pass onward exactly the flow it receives. section 18.4.1
Model the problem with these elements:
- Use a source s with only outgoing edges and a sink t with only incoming edges. section 18.4.1
- Treat edge capacity as the maximum permitted amount, such as the volume a pipe can carry. section 18.4.1
- Route inbound flow through intermediate vertices without increasing its total amount. section 18.4.1
Choosing a useful route
If vertex D can receive five units but can theoretically send six, its actual outbound flow cannot exceed its inbound flow. When the route from F to the sink carries only one unit, sending D’s flow toward G can increase the sink’s total flow. section 18.4.1
