原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
en to stop? The following corollary gives the answer: when there are no augmenting paths.
Corollary 25.4 Matching M in graph G = (V, E) is a maximum matching if and only if G contains no M-augmenting path. Proof We prove the contrapositive of both directions of the lemma statement. The contrapositive of
the forward direction is straightforward. If there is an M-augmenting path P in G, then b
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea