#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: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: u/ncohen/12797 | Commit:
Dependencies: | Stopgaps:
----------------------------------+----------------------------------
Changes (by ncohen):
* status: new => needs_review
* branch: => u/ncohen/12797
Comment:
OKayyyyyyyyyyyy, looks like converting the digraph was sufficient `:-)`
By the way it also fixes a "theoretical bug" : I am not sure that this
code was meant to handle the situation where there is a cycle in the
residual graph (I don't know if it ever happens). With this, no problem.
Thanks for the report ! Now this patch just needs a review before being
merged into Sage.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/12797#comment:6>
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.
