#12797: The cut returned by edge_cut of undirected weighted graphs is sometimes
incorrect
-------------------------------------+-------------------------------------
Reporter: hartke | Owner: jason, ncohen, rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen, | Reviewers:
Florian Oosterhof | Work issues:
Report Upstream: N/A | Commit:
Branch: u/ncohen/12797 | 8f1ad732bd60a20b70626aaeb3f566a31214581e
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
> Should a sanity check be made that the label is positive? Not sure if a
flow graph with a 0 label can even be created.
Well, with this at the end of `GenericGraph._fork_fulkerson` I guess we
are safe
{{{
g.add_edges([(x,y,l) for ((x,y),l) in flow.iteritems() if l > 0])
}}}
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/12797#comment:10>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
