solve small-scale network flow problems, including the use of the ‘maximum flow-minimum cut’ theorem