New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

二分图最大匹配 | Hanzire's Blog #6

Open

ZXJNVRGVP opened this issue Sep 25, 2019 · 1 comment

Labels

2019-07-07T09-59-04 Gitalk

Owner

ZXJNVRGVP commented Sep 25, 2019

https://zxjnvrgvp.github.io/%E5%8C%88%E7%89%99%E5%88%A9%E7%AE%97%E6%B3%95/

定义
匹配：任意两条边都没有公共端点的边的集合被称为图的一组匹配。

最大匹配：在二分图中，包含边数最多的一组匹配。

匹配边与非匹配边：对于任意一组匹配S，属于S的边被称为匹配边，不属于S的被称为非匹配边。

匹配点与非匹配点：匹配边的端

ZXJNVRGVP added Gitalk 2019-07-07T09-59-04 labels

Owner Author

ZXJNVRGVP commented Sep 25, 2019

牛逼

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment