Differences

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

--- courses:cs211:winter2012:journals:joey:home [2012/04/04 03:46] – [Chapter 7 - Network Flow] brownjn
+++ courses:cs211:winter2012:journals:joey:home [2012/04/04 04:31] (current) – [Chapter 7 - Network Flow] brownjn
@@ Line 269: / Line 269: @@
 **7.7 - Extensions to the Maximum-Flow Problem**
-Imagine the situation in which there are multiple sinks and sources. In this case, instead of max flow, each node has a demand or a supply
+Imagine the situation in which there are multiple sinks and sources. In this case, instead of max flow, each node has a demand or a supply. In order to solve this problem, again, add a sink and source, or super-sink and super-source. The capacities of the edges going from the super-source to the supply nodes are equal to the supply offered by those nodes; and the edges going from the demand nodes to the super-sink are equal to the demand by those nodes. Then it is just a max flow problem.
+**Interest:** 10 (taking Networks with Stough and this is pretty relevant)
+**Readiblity:** 5 (the language could have been clearer)