Revision as of 17:24, 12 September 2011 edit 0g1o2i3k4e5n6 (talk \| contribs) 95 edits No edit summary ← Previous edit		Revision as of 17:25, 12 September 2011 edit undo 0g1o2i3k4e5n6 (talk \| contribs) 95 edits No edit summary Next edit →
Line 24: [[Special:Contributions/128.148.33.99\|128.148.33.99]] ([[User talk:128.148.33.99\|talk]]) 21:44, 14 July 2010 (UTC) :One source that points this out and gives a correct version of the algorithm is Jungnickel ''Graphs, Networks and Algorithms''. --[[Special:Contributions/46.253.62.108\|46.253.62.108]] ([[User talk:46.253.62.108\|talk]]) 05:06, 7 September 2011 (UTC) ::I made a correct description of the algorithm in de.WP and also provided a correct example. [[:de:Paarung_(Graphentheorie)#Algorithmus_von_Edmonds]]. Not sure when or if I will find time & leisure to translate it. --[[user:0g1o2i3k4e5n6\|goiken]] 17:24, 12 September 2011 (UTC) ===Blossom Diagram & Augmenting path=== In the first blossom diagram, the augmenting path that is shown starts at u. Since u is adjacent to an edge in the matching, that isn't an augmenting path, right? [[User:Zabwung\|Zabwung]] ([[User talk:Zabwung\|talk]]) 00:58, 6 July 2011 (UTC)

Talk:Blossom algorithm: Difference between revisions