Revision as of 19:20, 30 June 2017 edit 46.189.28.193 (talk) →Augmenting paths ← Previous edit		Revision as of 12:23, 4 July 2017 edit undo 132.68.61.154 (talk) →Blossoms and contractions Next edit →
Line 69: '''''Finding Blossoms:''''' * Traverse the graph starting from an exposed ~~or a free~~ vertex. * Starting from that vertex, label it as an outer vertex "'''''o'''"''. * Alternate the labeling between vertices being inner "'''''i'''"'' and outer "'''''o'''"'' such that no two adjacent vertices have the same label.

Blossom algorithm: Difference between revisions