Edexcel AS Further Mathematics 8FM0 · D2.2.3
Max-flow min-cut theorem
- Code
- D2.2.3
- In
- D2.2 Flows in networks
- Topic
- D2 Decision Mathematics 2
- Course
- AS Further Mathematics 8FM0
- Board
- Edexcel
Codes and titles are read by a script from Edexcel's published specification and have not been checked by a person. What each point covers is in the specification itself: Edexcel’s specification.
Points in D2.2 Flows in networks
- D2.2.1 Cuts and capacity
- D2.2.2 Labelling procedure for maximum flow
- D2.2.3 Max-flow min-cut theorem