Feature/centroid decomposition#7089
Closed
lens161 wants to merge 22 commits intoTheAlgorithms:masterfrom
Closed
Conversation
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #7089 +/- ##
============================================
+ Coverage 78.46% 78.51% +0.05%
- Complexity 6746 6776 +30
============================================
Files 758 759 +1
Lines 22339 22419 +80
Branches 4384 4397 +13
============================================
+ Hits 17528 17602 +74
- Misses 4107 4111 +4
- Partials 704 706 +2 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Author
|
Everything regarding my changes passes. the build fail comes from: |
|
This pull request has been automatically closed because its workflows or checks failed and it has been inactive for more than 14 days. Please fix the workflows and reopen if you'd like to continue. Merging from main/master alone does not count as activity. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
clang-format -i --style=file path/to/your/file.javaSummary:
This PR adds an implementation of centroid decomposition for trees. The algorithm recursively finds centroids of subtrees and builds a centroid tree with height O(log n). This structure is useful for answering distance, nearest node, and other divide and conquer tree queries.
Details:
Supports adding edges to an undirected tree
Builds the centroid decomposition via build()
Provides access to centroid parents and children
Includes a helper to iterate over centroid ancestors
Tests cover subtree sizes, parent relationships, children, reset behaviour, and consistency