#14412: Bug in DiGraph.longest_path
---------------------------------+------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.9
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Nathann Cohen | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Changes (by ncohen):
* status: new => needs_review
Comment:
Most stupig bug ever. I fixed it without noticing what I did, and it turns
out that `DiGraph.incoming_edges()` can be called without any argument,
which has no sensible meaning at all. Turns out that the code should have
been calling `incoming_edges(v)` but called `incoming_edges()` instead
`-_-`
Needs a review !
Nathann
(I also moved a "solver" argument from one place to another, as this is
the way things are done nowadays with the LP backends)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14412#comment:1>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
