← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

25 第25章 二分图匹配

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

at has an incident edge in matching M is matched under M, and otherwise, it is unmatched.

A maximal matching is a matching M to which no other edges can be added, that is, for every edge e ∈ E − M, the edge set M ∪ {e} fails to be a matching. A maximum matching is always maximal, but the reverse does not

always hold. Many algorithms to find maximum matchings, the Hopcroft-Karp algorithm inclu

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea