Differences

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

--- courses:cs211:winter2018:journals:patelk:chapter7 [2018/03/31 17:50] – [7.7 Extensions to the Maximum-Flow Problem] patelk
+++ courses:cs211:winter2018:journals:patelk:chapter7 [2018/03/31 17:53] (current) – [7.7 Extensions to the Maximum-Flow Problem] patelk
@@ Line 262: / Line 262: @@
   * There is a feasible circulation in G if and only if there is a feasible circulation in G'
     * If all demands, capacities, and lower bounds in G are integers and there is a feasible circulation, then there is a feasible circulation that is integer-valued.
+==== Personal Thoughts ====
+This section took the concept of network flows to the next level by bringing in other variations/extensions of the original problem. While the overarching problems made sense, I got bogged down in a lot of the terminology and new factors that were added in. I think I need to reread this section one more time after we go over it in class to fully grasp the concepts presented in this section.
+Readability: 5.5
+Interesting: 5.5
+----