Network flow. A second example demonstrating how to compute circulation with demands at nodes (i.e., one or more nodes supply traffic, one or more nodes consume traffic). After converting the initial graph to one with a single source node and a single sink node, the Ford Fulkerson algorithm for computing maximum flow can be used.
