Flow Problems is a part of the VCE Further Maths topic Networks and Decision Mathematics. This post looks at the use of networks to model flow problems, in the context of capacity, sinks and sources. It also looks at finding the solution of small-scale network flow problems by inspection and the use of the ‘maximum-flow minimum-cut’ theorem to aid the solution of larger scale problems.
This next video introduces flow problems and how to solve them.
What is the Maximum-Flow Minimum-Cut Theory?
Watch this next video to learn about the maximum-flow minimum-cut algorithm.
Want to learn more? Check out more of our VCE Mathematics resources here!