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 Vertex/Edge disjoint st-paths #7292
Comments
This comment has been minimized.
This comment has been minimized.
comment:3
|
comment:4
not anymore :-) |
Author: Nathann Cohen |
comment:5
Attachment: trac_7292.patch.gz |
Reviewer: Robert Miller |
comment:6
I get the following failure:
|
comment:8
Here it is !! Please check, when appying it, that nothing disappears "above" and "after" the added sections ! If this version is not easier to apply, I think the best way would be to create a patch based upon the version you are working on and the patch you already applied (this should not be long though, this patch just adds two consecutive functions) Sorry for the trouble ! :-) Nathann |
Work Issues: needs rebase (#7634) |
comment:10
Rebased ! Nathann |
Merged: 4.3.1.alpha2 |
comment:11
Attachment: trac_7292-2.patch.gz positive review |
Changed merged from 4.3.1.alpha2 to sage-4.3.1.alpha2 |
With the flow function from #7592, functions returning a maximal number of Vertex/Edge disjoint st-path should be defined. The will obviously use the flow functions, but in many applications the user is just interested in these paths, and so there should be an easy way to find them in Sage.
Component: graph theory
Work Issues: needs rebase (#7634)
Author: Nathann Cohen
Reviewer: Robert Miller
Merged: sage-4.3.1.alpha2
Issue created by migration from https://trac.sagemath.org/ticket/7292
The text was updated successfully, but these errors were encountered: