#9350: Python max flow method
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, mvngu, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.5
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Description changed by ncohen:
Old description:
> Implementation of a max-flow algorithm which does not use Linear
> Programming.
>
> I will update it right after #8870 is merged
>
> Nathann
New description:
Implementation of a max-flow algorithm which does not use Linear
Programming.
I will update it right after #8870 is merged
TODO: compare the speeds of functions like edge connectivity, gomory-hu,
etc ....
Nathann
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9350#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
