AM-41 - Flow modeling

- 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
CV-31 - Flow Maps
Flow mapping is a cartographic method of representing movement of phenomena. Maps of this type often depict the vector movement of entities (imports and exports, people, information) between geographic areas, but the general method also encompasses a range of graphics illustrating networks (e.g., transit and communications grids) and dynamic systems (e.g., wind and water currents). Most flow maps typically use line symbols of varying widths, lengths, shapes, colors, or speeds (in the case of animated flow maps) to show the quality, direction, and magnitude of movements. Aesthetic considerations for flow maps are numerous and their production is often done manually without significant automation. Flow maps frequently use distorted underlying geography to accommodate the placement of flow paths, which are often dramatically smoothed/abstracted into visually pleasing curves or simply straight lines. In the extreme, such maps lack a geographic coordinate space and are more diagrammatic, as in Sankey diagrams, alluvial diagrams, slope graphs, and circle migration plots. Whatever their form, good flow maps should effectively visualize the relative magnitude and direction of movement or potential movement between a one or more origins and destinations.