《计算模型与算法技术教学课件》10-Iterative Improvement.pptVIP

* * In order to provide a more interesting example, we will start with the matching M shown here. After we are finished, if you desire, we can go through the algorithm from the empty set (which is a much more simplistic example). * * * * Case 1 (w is in V)If u is free, augment the matching along the path ending at u by moving backwards until a free vertex in V is reached. After that, erase all labels and reinitialize Q with all the vertices in V that are still freeIf u is matched (not with w), label u with w and enqueue u Case 2 (w is in U) Label its matching mate v with w and enqueue