Differences

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

--- courses:cs211:winter2014:journals:kinsey:home [2014/04/01 13:40] – [7.1 Maximum Flow Problem and the Ford-Fulkerson Algorithm] schellk
+++ courses:cs211:winter2014:journals:kinsey:home [2014/04/03 15:32] (current) – [7.7] schellk
@@ Line 187: / Line 187: @@
 ====== 7.1 Maximum Flow Problem and the Ford-Fulkerson Algorithm ======
 {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-04-01_at_9.38.12_am.png |}}
-====== Maximum Flows and Minimum Cuts in a Network ======
+Readability: 7.2
+====== 7.2 Maximum Flows and Minimum Cuts in a Network ======
+{{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-04-01_at_10.20.54_am.png|}}
+Readability: 7
+====== 7.5 ======
+{{:courses:cs211:winter2014:journals:kinsey:screenshot_from_2014-04-01_21_43_21.png?200|}}
+Readability: 3
+====== 7.7 ======
+{{:courses:cs211:winter2014:journals:kinsey:s1.jpg|}}
+Readability: 2