原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
the directed edges in H. Moreover, every shortest M-augmenting path in G is present in H.
The third phase identifies a maximal set of vertex-disjoint shortest M-augmenting paths. As Figure 25.3 shows, it starts by creating the transpose HT of H. Then, for each unmatched vertex r in layer q, it performs
a depth-first search starting from r until it either reaches a vertex in layer 0 or has e
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea