← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

25 第25章 二分图匹配

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.740Z

(r4, l5), (l5, r7), (r7, l6)〉 highlighted in yellow, discovering vertices r4, l5, r7, l6.

It remains to show that all three phases of line 3 take O(E) time. We assume that in the original bipartite graph G, each vertex has at least one incident edge so that |V| = O(E), which in turn implies that |

V| + |E| = O(E). The first phase creates the directed graph GM by simply directing each ed

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea