-
-
Notifications
You must be signed in to change notification settings - Fork 488
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.
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
Implemented methods pertaining to the canonical partition of a matching covered graph #38892
base: develop
Are you sure you want to change the base?
Conversation
Documentation preview for this PR (built with commit ee8bdbd; changes) is ready! 🎉 |
in the description of this PR, you say that it fixes #38216 but this is not the case. It is part of that issue, or a follow-up of that issue. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
in the PR description, you must indicate that this PR depends on #38742
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM.
The objective of this issue is to implement the methods pertaining to the canonical partition of a matching covered graph.
More specifically, this PR aims to implement the following two methods:
maximal_barrier()
: Return the (unique) maximal barrier containing the provided vertex.canonical_partition()
: Return the canonical partition of the (matching covered) graph.This PR shall address the methods related to canonical partition of matching covered graphs.
Fixes #38216. Note that this issue fixes a small part of the mentioned issue.
📝 Checklist
⌛ Dependencies
This PR depends on the PR #38742.
cc: @dcoudert.