Describe practical situations in which flow is conserved while splitting or joining at nodes of the network

Apply a maximum flow algorithm to calculate the largest flow from a source to a sink, using the edges of the network, subject to capacity constraints on the arcs and the conservation of flow

Explain how the concept of capacity represents an upper limit on the amount of flow through the network

Demonstrate how capacity is assigned to edges in a network using the appropriate data structure

## Keywords:

ucgis <gistbok@ucgis.org>