原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
dges in M from R to L and all other edges from L to R. Finding an M-augmenting path in Gh
To find an M-augmenting path in the equality subgraph Gh with a matching M, the Hungarian algorithm first creates the directed equality subgraph GM,h from Gh, just as the Hopcroft-Karp algorithm creates GM from
G. As in the Hopcroft-Karp algorithm, you can think of an M-augmenting path as starting f
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea