The diagram shows a power network with one power plant, two switching stations and , and three towns. Power can flow only in the direction of the arrows. The capacity of each line, in megawatts (MW), is given in the table, where, for example, - is the line that leaves and arrives at .
Find the largest total power, in MW, that the network can deliver to the three towns together. (Diagram not to scale.)
Worked solution
Cuts that separate the plant from the three towns: round the plant alone, ; round the plant and , ; round the plant and , ; round the plant, and , .
By the maximum-flow minimum-cut theorem, the largest total flow equals the smallest cut capacity, which is MW.
Answer
Marking guidelines
Identifies cuts that separate the plant from all three towns, counting only lines that leave the plant side | 1 mark |
Finds the capacity of each cut by adding the capacities of the lines it crosses | 1 mark |
States that the maximum flow equals the smallest cut capacity | 1 mark |
Report a problem with this question.
