#7292: Max Vertex/Edge disjoint st-paths
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* upstream: => N/A
Old description:
> With the functions from #6680, 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.
New description:
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.
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7292#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.
