AQA A-level Further Mathematics 7367 · 3.5.3

DC: Network flows

Code: 3.5.3
In: 3.5 Optional application 3 – discrete mathematics
Course: A-level Further Mathematics 7367
Board: AQA

Codes and titles are read by a script from AQA's published specification and have not been checked by a person. What each point covers is in the specification itself: AQA’s specification.

Points under 3.5.3

DC1 Flow problems on directed networks
DC2 Cuts and their values
DC3 Maximum flow-minimum cut theorem
DC4 Supersources and supersinks
DC5 Augmenting flows to find the maximum flow
DC6 Arcs with upper and lower capacities
DC7 Nodes of restricted capacity

Points in 3.5 Optional application 3 – discrete mathematics

3.5.1 DA: Graphs
3.5.2 DB: Networks
3.5.3 DC: Network flows
3.5.4 DD: Linear programming
3.5.5 DE: Critical path analysis
3.5.6 DF: Game theory for zero-sum games
3.5.7 DG: Binary operations