ATARMAxxing · VCE General Mathematics revision notes
Shortest Path, Flow & Matching
Unit 4 AOS2 — Networks & decision mathematics
What this note covers
- Shortest Path by Inspection and Dijkstra's Algorithm
- Flow Networks and Capacities
- Maximum Flow - Minimum Cut Theorem
- Bipartite Graphs and Allocation/Matching
- The Hungarian Algorithm for Optimal Allocation
5 sections · 13 key terms & formulas · 6 common mistakes
Included in the VCE 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 VCE General Mathematics hub →