Talk:Edmonds–Karp algorithm: Difference between revisions

Revision as of 07:45, 24 June 2007

Revision as of 15:15, 23 October 2007

Line 50:

: Note how values are updated when backtracking the path. The net flow is maintained. [[Flow network#Definition|Skew symmetry]] is upheld. Klem fra [[User:Nils Grimsmo|Nils Grimsmo]] 20:29, 25 March 2007 (UTC)

At the end of the example it says that the minimal cut partitions the nodes into ''"sets {A,B,C,E} and {D,F,G}, with the capacity c(A,D) + c(C,D) + c(E,G) = 3 + 1 + 1 = 5."'' But isn't the capacity here missing edge (D,E) with c(D,E) = 2 ? The capacity of the two sets would then be 7 instead of 5.