Blossom algorithm: Difference between revisions

Content deleted Content added
m Analysis: removed an extra space
m Analysis: moved a period to before a reference
Line 150:
===Analysis===
 
The forest ''F'' constructed by the ''find_augmenting_path()'' function is an alternating forest.<ref name = "kenyon report">{{cite
| author1 = Kenyon, Claire
| author2 = Lovász, László
Line 156:
| contribution = Algorithmic Discrete Mathematics
| title = Technical Report CS-TR-251-90, Department of Computer Science, Princeton University
}}</ref>.
* a tree ''T'' in ''G'' is an '''alternating tree''' with respect to ''M'', if
** ''T'' contains exactly one exposed vertex ''r'' called the tree root