Implement Stoer-Wagner algorithm for minimum cut#6791
Closed
GURUPRASADPANDA wants to merge 1 commit intoTheAlgorithms:masterfrom
Closed
Implement Stoer-Wagner algorithm for minimum cut#6791GURUPRASADPANDA wants to merge 1 commit intoTheAlgorithms:masterfrom
GURUPRASADPANDA wants to merge 1 commit intoTheAlgorithms:masterfrom
Conversation
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## master #6791 +/- ##
============================================
+ Coverage 77.54% 77.79% +0.25%
- Complexity 6293 6308 +15
============================================
Files 728 728
Lines 20976 21012 +36
Branches 4086 4097 +11
============================================
+ Hits 16265 16346 +81
+ Misses 4076 4022 -54
- Partials 635 644 +9 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Member
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.
This PR adds an implementation of the Stoer-Wagner algorithm to compute the minimum cut in an undirected, weighted graph. The minimum cut identifies the smallest set of edges whose removal partitions the graph into two disconnected components.
Key Features:
Why this contribution?
Tested: