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
Create Bipartite Graph according to 2 degree sequences #7590
Comments
comment:1
Here it is ! |
This comment has been minimized.
This comment has been minimized.
comment:4
Well, I'd say this patch is ready for review (as it is written and functional) even though #7301 is not :-) The discussion in #7301 could lead to a gale_ryser function which does not use GLPK ( and may be even more efficient ), which is good for everybody :-) As this function is not so fundamental to Sage, I see no harm in making it wait until #7301 is ready :-) |
comment:5
Attachment: trac_7590.patch.gz Added # optional to some doctests. |
Reviewer: Robert Miller |
Author: Nathann Cohen |
Work Issues: waiting on #7301 |
comment:7
(This is fine by me once #7301 is ready...) |
comment:9
positive review. |
Merged: 4.3.1.alpha2 |
comment:10
Thanks !! :-) |
Changed merged from 4.3.1.alpha2 to sage-4.3.1.alpha2 |
Given the sequence of degrees for set A and a sequence of degree for set B, create the corresponding bipartite graph if possible.
This patch uses #7301 and incidentally the packages GLPK ( or CBC, but this one is under review at the moment )
CC: @wdjoyner
Component: graph theory
Work Issues: waiting on #7301
Author: Nathann Cohen
Reviewer: Robert Miller
Merged: sage-4.3.1.alpha2
Issue created by migration from https://trac.sagemath.org/ticket/7590
The text was updated successfully, but these errors were encountered: