原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
e number of iterations of the the repeat loop of lines 2–5 of HOPCROFT-KARP by . ★ 25.1-5
A perfect matching is a matching under which every vertex is matched. Let G = (V, E) be an undirected bipartite graph with vertex partition V = L ∪ R, where |L| = |R|.
For any X ⊆ V, define the neighborhood of X as N(X) = {y ∈ V : (x, y) ∈ E for some x ∈ X}
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea