Hopcroft–Karp algorithm: Difference between revisions

Content deleted Content added
Revert to revision 78972711 dated 2006-10-02 00:53:46 by David Eppstein using popups
No edit summary
Line 7:
: <math>M \leftarrow \empty</math>
: '''repeat'''
:: <math>\mathcal P \leftarrow \{P_1, P_2, \dots, P_k\}</math> ''maximummaximal set of vertex-disjoint shortest augmenting paths''
:: <math>M \leftarrow M \oplus (P_1 \cup P_2 \cup \dots \cup P_k)</math>
: '''until''' <math>\mathcal P = \empty</math>