The Ford-Fulkerson Algorithm is a part of the VCE Further Maths topic Networks and Decision Mathematics and subtopic Flow Problems. This algorithm looks at solving the maximum-flow minimum-cut problems.
This next video introduces the Ford-Fulkerson Algorithm.
Want to learn more? Check out more of our VCE Mathematics resources here!
Get exclusive VCE content & advice from our team of experts delivered weekly to your inbox!
Attend our master-class workshops on how to ace your essays, assessments and exams!
Attend our master-class workshops on how to ace your essays, assessments and exams!
Attend our master-class workshops on how to ace your essays, assessments and exams!
Attend our master-class workshops on how to ace your essays, assessments and exams!
Get exclusive study content & advice from our team of experts delivered weekly to your inbox!
