#13380: Suurballe-Tarjan algorithm for pair of disjoint st-paths
-----------------------------------------+----------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-5.6
Component: graph theory | Resolution:
Keywords: graph, disjoint paths | Work issues:
Report Upstream: N/A | Reviewers: Nathann Cohen
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
-----------------------------------------+----------------------------------
Comment (by dcoudert):
> Honestly I would sleep much better if those functions return raised an
exception on graphs with multiple edges. Dealing with those is a waste of
computations on the usual cases, and it will add scores of stupid "if" in
the code. I hate this `-_-`
So should I raise an exception in all cases or only for edge-disjoint
paths?
> > Well, it depends on the situation. Sometimes you have several labels
per edge stored in a dictionary, or you have only one numerical value. We
need at least 2 ways to store edge data.
> > Now I agree that I was a bit extreme in the options offered to the
user (but strings were useful for Kautz :-P ).
> >
> > I can certainly reduce, but which are the options to keep ?
>
> Well.. All other graphs methods just accept as input a edge whose label
is a weight.. Why would we need anything else ?
Networkx stores edge weights in a dictionary (default key: 'weight'). I
have also examples of graphs where it is convenient to use a dictionary to
store weights, labels, colors, etc. So I can let dictionary and numbers
and remove other options.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13380#comment:7>
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.
