Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2014:journals:colin:chapter7 [2014/04/02 07:07] – created mohnacsc
+++ courses:cs211:winter2014:journals:colin:chapter7 [2014/04/02 07:16] (current) – [7.7 - Extensions to the Maximum-Flow Problem] mohnacsc
@@ Line 55: / Line 55: @@
 ==== 7.7 - Extensions to the Maximum-Flow Problem ====
+Circulations with Demands:
+Suppose there can be multiple source and sink nodes.  Assuming fixed supply and sink values, we incorporate a demand value with each node, negative if it sends flow and positive if it receives flow.  If there is a feasible circulation with demands d(v), then all for all cuts (A,B) SUM(d(v)) <= c(A,B).