Revision as of 11:55, 8 February 2010 edit 151.68.39.88 (talk) →Edmonds-Karp Example ← Previous edit		Revision as of 11:56, 8 February 2010 edit undo 151.68.39.88 (talk) →Minimum Cut: new section Next edit →
Line 61: ==Application to [[hypergraph]]s== Is the Edmonds–Karp algorithm extensible to [[hypergraph]]s?--[[Special:Contributions/134.68.140.60\|134.68.140.60]] ([[User talk:134.68.140.60\|talk]]) 16:57, 29 January 2010 (UTC) == Minimum Cut == In the example can you explain why that's the minimum cut and how you find it?

Talk:Edmonds–Karp algorithm: Difference between revisions