原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
(b) depicts an M-augmenting path (sometimes called an augmenting path with respect to M):
an M-alternating path whose first and last edges belong to E − M. Since an M-augmenting path contains one more edge in E − M than in M, it must consist of an odd number of edges. Figure
25.1 A bipartite graph, where V = L ∪ R, L = {l1, l2, … , l7}, and R = {r1, r2, … , r8}.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea