#8893: disjoint routed paths
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.4.2
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Description changed by ncohen:
Old description:
> This patch implements the method disjoint_routed_path (k-DRP) which
> solves the following problem :
>
> given a list of pairs s_i, t_i, find in a given graph a set of vertex-
> disjoints paths P_i such that P_i goes from s_i to t_i
>
> Using #8870
New description:
This patch implements the method disjoint_routed_path (k-DRP) which solves
the following problem :
given a list of pairs s_i, t_i, find in a given graph a set of vertex-
disjoints paths P_i such that P_i goes from s_i to t_i
Requires #8870
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8893#comment:2>
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.
