原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
oes through her ranking of the n men in order, possibly not reaching the end of her list,
the total number of iterations is at most n2. Therefore, the while loop always terminates, and the procedure returns a matching. We need to show that there are no blocking pairs. We first observe that once a man m is
engaged to a woman w, all subsequent actions for m occur in lines 6–8. Therefore, once a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea