-
-
Notifications
You must be signed in to change notification settings - Fork 512
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
Max Cut #7291
Comments
comment:2
You should include more examples in your doctests. At least make sure that each input is tested. For example:
Shouldn't this be returning two sets of vertices? |
comment:3
I had forgotten the implication : vertices=True => value_only=True :-) Updated ! |
Attachment: trac_7291.patch.gz |
Reviewer: Robert Miller |
Author: Nathann Cohen |
Merged: sage-4.3.rc1 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Max cut is a NP-Hard problem, which could as usual be written as a LP if no better solution is found.
http://en.wikipedia.org/wiki/Maximum_cut
Component: graph theory
Author: Nathann Cohen
Reviewer: Robert Miller
Merged: sage-4.3.rc1
Issue created by migration from https://trac.sagemath.org/ticket/7291
The text was updated successfully, but these errors were encountered: