AQA AS Further Mathematics 7366 · DC3
Maximum flow-minimum cut theorem
- Code
- DC3
- In
- 3.5.3 DC: Network flows
- Topic
- 3.5 Optional application 3 – discrete mathematics
- Course
- AS Further Mathematics 7366
- 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 in 3.5.3 DC: Network flows
- DC1 Flow problems on directed networks
- DC2 Cuts and their values
- DC3 Maximum flow-minimum cut theorem
- DC4 Supersources and supersinks