原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
ected equality subgraph “on the fly,” as long we do not counteract the work already done.
The Hungarian algorithm updates the feasible vertex labeling h to fulfill the following criteria: No edge in the breadth-first forest F leaves the directed equality subgraph. No edge in the matching M leaves the
directed equality subgraph. At least one edge (l, r), where l ∈ L ∩ VF and r ∈ R − VF goe
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea