Skip to content
New issue

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

#

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

Already on GitHub? # to your account

Jump to bottom

use decomposition into biconnected components in Gomory-Hu tree #39478

Open
wants to merge 6 commits into
base: develop
Choose a base branch
from
Open

use decomposition into biconnected components in Gomory-Hu tree #39478

wants to merge 6 commits into from

Conversation

dcoudert
Copy link
Contributor

@dcoudert dcoudert commented Feb 8, 2025

We use method blocks_and_cut_vertices to decompose the graph into biconnected components.

  • isolated vertices can be ignored
  • a block of size 2 is a cut-edge. It suffices to add an edge of capacity 1 to the tree.
  • it remains to compute the Gomory-Hu trees of the remaining biconnected components.

📝 Checklist

  • The title is concise and informative.
  • The description explains in detail what this PR is about.
  • I have linked a relevant issue or discussion.
  • I have created tests covering the changes.
  • I have updated the documentation and checked the documentation preview.

⌛ Dependencies

@dcoudert dcoudert self-assigned this Feb 8, 2025
@github-actions GitHub Actions
Copy link

github-actions bot commented Feb 8, 2025 •
edited
Loading

Documentation preview for this PR (built with commit 03a79d1; changes) is ready! 🎉
This preview will update shortly after each push to this PR.

# for free to join this conversation on GitHub. Already have an account? # to comment
Reviewers
No reviews
Assignees

@dcoudert dcoudert

Labels
c: graph theory s: needs review
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@dcoudert