Implement bitwise dp algorithm and sos dp#7517
Open
narendrakumar9867 wants to merge 1 commit into
Open
Conversation
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #7517 +/- ##
============================================
- Coverage 80.25% 80.24% -0.02%
- Complexity 7358 7376 +18
============================================
Files 810 811 +1
Lines 23787 23825 +38
Branches 4678 4693 +15
============================================
+ Hits 19091 19118 +27
- Misses 3940 3943 +3
- Partials 756 764 +8 ☔ View full report in Codecov by Harness. 🚀 New features to boost your workflow:
|
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
3 participants
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.
This PR adds a new bitmask dynamic programming solution for the Traveling Salesman Problem. It implements the classic Held-Karp subset DP approach for small graphs, with support for missing edges and overflow-safe cost accumulation.
What changed:
Added unit tests covering:
Testing:
Added JUnit tests for the new implementation