#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.4
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen, | Reviewers: David Coudert
Florian Oosterhof | Work issues:
Report Upstream: N/A | Commit:
Branch: u/ncohen/12797 | f7c8b16d912c1f8368e8188542887f3cf1c3dd1c
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dcoudert):
Replying to [comment:15 ncohen]:
> Yo !
>
> > You should add another line of example with {{{method='LP'}}}.
>
> To test what exactly? The LP method does not use the code that is being
changed here, and there are already some doctests with the LP method in
this function?...
The description of this patch compares the result returned by FF with the
one of LP.
Adding one line will show that everything is in order.
> > Furthermore, the conversion to digraph should be done only if self is
undirected, right?
>
> Well, edges are added/removed from the copy several lines later?...
OK
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/12797#comment:17>
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.
