- 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
This knowledge area embodies a variety of data driven analytics, geocomputational methods, simulation and model driven approaches designed to study complex spatial-temporal problems, develop insights into characteristics of geospatial data sets, create and test geospatial process models, and construct knowledge of the behavior of geographically-explicit and dynamic processes and their patterns.
Topics in this Knowledge Area are listed thematically below. Existing topics are linked directly to either their original (2006) or revised entries; forthcoming, future topics are italicized.