#17410: unambiguously doctest longest_path()
----------------------------+----------------------------------------
Reporter: charpent | Owner:
Type: defect | Status: new
Priority: trivial | Milestone: sage-6.5
Component: graph theory | Keywords:
Merged in: | Authors: Emmanuel Charpentier
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
----------------------------+----------------------------------------
A doctest or longest_path() is ambiguous :
{{{
sage: l = [(0, 1), (0, 3), (2, 0)]
sage: G = DiGraph(l)
sage: G.longest_path().edges()
[(0, 3, None), (2, 0, None)]
}}}
Starting with sage 6.5beta1, sage gives the equally valid answer
{{{
[(0, 1, None), (2, 0, None)]
}}}
but this is detected as a failure by sage ptestlong.
So let's use a problem with a unique solution.
--
Ticket URL: <http://trac.sagemath.org/ticket/17410>
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.
