ATARMAxxing · QCE General Mathematics revision notes
Maximum Flow, Bipartite Graphs and the Hungarian Algorithm
Network Flow and Assignment
What this note covers
- Network Flow: Foundations and Terminology
- The Maximum Flow–Minimum Cut Theorem
- Applying the Ford–Fulkerson Method Systematically
- Bipartite Graphs and Assignment Problems
- The Hungarian Algorithm: Step-by-Step
- Maximisation Assignments and Non-Square Matrices
- Connecting Maximum Flow and Matching: A Synthesis
7 sections · 14 key terms & formulas · 6 common mistakes
Included in the QCE General Mathematics Mastery Pack
20 full-length practice exams with worked solutions, 20 revision notes, 64 practice questions and 200 flashcards.
Unlock General Mathematics — $20
Preview a sample note and question free on the QCE General Mathematics hub →