feat(graph): Add Edmonds's algorithm for minimum spanning arborescence#6771
Merged
alxkm merged 2 commits intoTheAlgorithms:masterfrom Oct 13, 2025
Merged
Conversation
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #6771 +/- ##
============================================
+ Coverage 77.33% 77.43% +0.10%
- Complexity 6175 6208 +33
============================================
Files 721 722 +1
Lines 20600 20680 +80
Branches 3994 4019 +25
============================================
+ Hits 15931 16014 +83
+ Misses 4056 4054 -2
+ Partials 613 612 -1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
alxkm
approved these changes
Oct 13, 2025
Member
alxkm
left a comment
There was a problem hiding this comment.
Looks good. Thank you for the contribution.
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.
Description
Closes #6755
This PR adds a complete implementation of Edmonds's algorithm for finding the Minimum Spanning Arborescence in a directed graph.
The implementation follows the project's coding standards and includes:
finalutility classEdmonds.javawith a private constructor.EdmondsTest.javafile with thorough JUnit 5 tests covering various scenarios, including simple graphs, graphs with cycles, unreachable nodes, and invalid inputs.Gifs/Screenshots (if applicable)
N/A
Checklist