-
Notifications
You must be signed in to change notification settings - Fork 20.8k
Feature/centroid decomposition #7075
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
Draft
lens161
wants to merge
18
commits into
TheAlgorithms:master
Choose a base branch
from
lens161:feature/centroid-decomposition
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Draft
Feature/centroid decomposition #7075
lens161
wants to merge
18
commits into
TheAlgorithms:master
from
lens161:feature/centroid-decomposition
Conversation
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
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #7075 +/- ##
============================================
+ Coverage 78.33% 78.51% +0.17%
- Complexity 6661 6776 +115
============================================
Files 752 759 +7
Lines 22180 22419 +239
Branches 4357 4397 +40
============================================
+ Hits 17375 17602 +227
- Misses 4106 4111 +5
- Partials 699 706 +7 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
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 of height O(log n). It is useful for distance queries and divide-and-conquer algorithms on trees.
Details
Allows adding edges to the original tree.
Builds the centroid decomposition with build().
Provides methods to get centroid parents and children.
Includes a method to visit all centroid ancestors of a node.
Includes JUnit tests.
CI check completed using: mvn clean verify