#13380: Suurballe-Tarjan algorithm for pair of disjoint st-paths
----------------------------+-----------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.3
Component: graph theory | Keywords:
Work issues: | Report Upstream: N/A
Reviewers: | Authors: David Coudert
Merged in: | Dependencies:
Stopgaps: |
----------------------------+-----------------------------------------------
This patch implements the
[http://en.wikipedia.org/wiki/Suurballe%27s_algorithm Suurballe-Tarjan
algorithm] for computing a pair of edge or vertex disjoint st-paths of
minimum total cost in a (Di)Graph. The cost is either the number of edges,
or the sum of the weights of the edges of the paths.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13380>
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.
