原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
m L to R must belong to E − M, and the edges in P traversed from R to L must belong to M.
The first phase, therefore, creates the directed graph GM by directing the edges accordingly: GM = (V, EM), where Figure 25.2 (a) The directed graph GM created in the first phase for the undirected bipartite
graph G and matching M in Figure 25.1(a). Breadth-first distances from any unmatched vert
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea