Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2014/digital-systems-linear-algebra-introduction-to-formal-proof/4/b/solution

Summing the flow conservation equations over all four junctions cancels every internal flow. The total entering flow is , and the known exiting flow is . Thus
The original arrows point , , , and for , respectively. In particular, exits north from .[ref]
The individual flow conservation equations are
Choose . Substitution gives all solutions of these linear equations:
The inequalities enforce nonnegative flows on all one-way streets. The last junction equation follows from the first three and total flow conservation, so it introduces no further restriction.
The maximum is . It makes . At , all 300 vehicles arriving from the west turn north and leave along ; none arrives from or continues east to .

New to topics? Read the docs here!