-
Notifications
You must be signed in to change notification settings - Fork 3
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
Add a new type: Dominating Set problem (without weights) #48
Conversation
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## main #48 +/- ##
==========================================
+ Coverage 88.67% 88.85% +0.18%
==========================================
Files 16 17 +1
Lines 680 691 +11
==========================================
+ Hits 603 614 +11
Misses 77 77 ☔ View full report in Codecov by Sentry. |
A possible typo in test/rules/rules.jl [ #44 ] Original: Should be: |
Conflicts resolved. |
We don't have weights for this problem. | ||
""" | ||
struct DominatingSet{ GT<:AbstractGraph} <: AbstractProblem | ||
graph::GT |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Each vertex can be associated with a weight.
No description provided.