1. A B C D 8 4 9 7 10 8 8 5 3 The diagram below shows water flowing through a pipework system. The values on the edges are the capacities of water that they can carry. The diagram below shows water flowing through a pipework system. The values on the edges are the capacities of water that they can carry. S T We can find the maximum flow through these pipes using the labelling procedure. Network Flows – Labelling procedure

2. A B C D Each edge will be labelled with two arrows. The forward arrow will indicate the amount of excess capacity – the potential increase. The backward arrow will indicate the current flow - the potential decrease. Initially the excess capacities are the full capacity and the flows are all zero. Each edge will be labelled with two arrows. The forward arrow will indicate the amount of excess capacity – the potential increase. The backward arrow will indicate the current flow - the potential decrease. Initially the excess capacities are the full capacity and the flows are all zero. S T 849 7 10 8 8 5 3 0 0 0 0 0 0 0 0 0 At each stage we try to find a path from S to T that consists of non-zero arrows. Initially there are there are many such flow augmenting paths. One example is SACT. At each stage we try to find a path from S to T that consists of non-zero arrows. Initially there are there are many such flow augmenting paths. One example is SACT. Network Flows – Labelling procedure The minimum arrow along this path is 4, and so this is the increase in the flow.

3. A B C D 8 4 9 7 10 8 8 5 3 We decrease all the arrows in the direction of this path by 4, and increase all the arrows against the direction of this path by 4. We decrease all the arrows in the direction of this path by 4, and increase all the arrows against the direction of this path by 4. S T 0 0 0 0 0 0 0 0 0 4 4 0 4 3 4 Network Flows – Labelling procedure Notice that AC is now saturated, so this arc cannot be used in any further flow augmenting paths.

4. Now we choose another flow augmenting path. One example is SABCT. A B C D 8 4 9 7 10 8 8 5 3 The minimum arrow along this path is 3, and so this the increase in the flow. We decrease all the arrows in the direction of this path by 3, and increase all the arrows against the direction of this path by 3. The minimum arrow along this path is 3, and so this the increase in the flow. We decrease all the arrows in the direction of this path by 3, and increase all the arrows against the direction of this path by 3. S T 0 0 0 0 0 0 0 0 0 4 4 0 4 3 4 1 7 03 2 3 0 7 Network Flows – Labelling procedure

5. Now we choose another flow augmenting path. One example is SABCT. A B C D 8 4 9 7 10 8 8 5 3 Arcs AB and CT are now saturated. S T 0 0 0 0 0 0 0 0 0 4 4 0 4 3 4 1 7 03 2 3 0 7 Network Flows – Labelling procedure

6. 4 For our next flow augmenting path let’s choose SBDT. A B C D 8 4 9 7 10 8 8 5 3 The minimum arrow along this path is 8, and so this is the increase in the flow. We decrease all the arrows in the direction of this path by 8, and increase all the arrows against the direction of this path by 8. The minimum arrow along this path is 8, and so this is the increase in the flow. We decrease all the arrows in the direction of this path by 8, and increase all the arrows against the direction of this path by 8. S T 0 0 0 0 0 0 0 0 0 4 4 0 4 3 1 7 03 2 3 0 7 1 8 0 8 2 8 Network Flows – Labelling procedure

7. 4 For our next flow augmenting path let’s choose SBDT. A B C D 8 4 9 7 10 8 8 5 3 Arc BD is now saturated. S T 0 0 0 0 0 0 0 0 0 4 4 0 4 3 1 7 03 2 3 0 7 1 8 0 8 2 8 Network Flows – Labelling procedure

8. 1 3 Are there any more flow augmenting paths? Remember we are looking for paths following non-zero arrows from S to T. Are there any more flow augmenting paths? Remember we are looking for paths following non-zero arrows from S to T. A B C D 8 4 9 7 10 8 8 5 3 S T 0 0 0 0 0 0 0 0 0 4 4 0 4 3 4 1 7 03 2 0 7 8 0 8 2 8 Yes, there is the path SBCDT, with minimum arrow 1, so we can increase the flow by 1. We decrease all the arrows in the direction of this path by 1, and increase all the arrows against the direction of this path by 1. Yes, there is the path SBCDT, with minimum arrow 1, so we can increase the flow by 1. We decrease all the arrows in the direction of this path by 1, and increase all the arrows against the direction of this path by 1. 0 9 1 4 7 1 1 9 Network Flows – Labelling procedure

9. 1 3 Are there any more flow augmenting paths? Remember we are looking for paths following non-zero arrows from S to T. Are there any more flow augmenting paths? Remember we are looking for paths following non-zero arrows from S to T. A B C D 8 4 9 7 10 8 8 5 3 S T 0 0 0 0 0 0 0 0 0 4 4 0 4 3 4 1 7 03 2 0 7 8 0 8 2 8 Arc SB is now saturated. 0 9 1 4 7 1 1 9 Network Flows – Labelling procedure

10. We now have a flow of 16 out of the source (backwards arrows) and into the sink. A B C D 8 4 9 7 10 8 8 5 3 S T 0 0 0 0 0 0 0 0 0 4 4 0 4 3 4 1 7 03 2 3 0 7 1 8 0 8 2 8 We can write the final flows on the diagram. We read them off the backward arrows on each edge. We can write the final flows on the diagram. We read them off the backward arrows on each edge. 0 9 1 4 7 1 1 9 4 8 9 77 3 3 1 9 Network Flows – Labelling procedure Since SB, AB, AC, BD and CT are all saturated, S and T are disconnected (there is no path from S to T using unsaturated arcs), so this is the maximum flow.