Hopcroft–Karp algorithm: Difference between revisions

Revision as of 00:53, 2 October 2006

Revision as of 17:33, 3 October 2006

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>