原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
e queue, the queue becomes empty before the search can discover an unmatched vertex in R.
To update the feasible vertex labeling, the Hungarian algorithm first computes the value where FL = L ∩ VF and FR = R ∩ VF denote the vertices in the breadth-first forest F that belong to L and R, respectively.
That is, δ is the smallest difference by which an edge incident on a vertex in FL missed
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea