Revision as of 12:11, 30 April 2014 edit יובל מדר (talk \| contribs) 177 edits →Augmenting paths ← Previous edit		Revision as of 06:38, 23 June 2014 edit undo AlanTonisson (talk \| contribs) 28 edits m →Blossoms and contractions: Fixed a minor grammatical mistake. Next edit →
Line 87: [[File:Edmonds lifting end point.svg\|500px\|alt=Path lifting when ''P’'' ends at ''v<sub>B</sub>'', two cases depending on the direction we need to choose to reach ''v<sub>B</sub>'']] Thus blossoms can be contracted and search performed in the contracted graphs. This reduction is at the heart of Edmonds's algorithm. ==Finding an augmenting path==

Blossom algorithm: Difference between revisions