#17410: unambiguously doctest longest_path()
-------------------------------------+-------------------------------------
Reporter: charpent | Owner:
Type: defect | Status: needs_review
Priority: trivial | Milestone: sage-6.5
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Emmanuel | Reviewers:
Charpentier, Vincent Delecroix | Work issues:
Report Upstream: N/A | Commit:
Branch: | fcc15b40f515eef263f8afdc6c4d848fa28fead0
u/charpent/unambiguously_doctest_longest_path__| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by {'newvalue': u'Emmanuel Charpentier, Vincent Delecroix',
'oldvalue': u'Emmanuel Charpentier'}):
* author: Emmanuel Charpentier => Emmanuel Charpentier, Vincent Delecroix
Comment:
Damn. You're right. The path is unique (G is directed). But edges() has no
special reason to sort them in any specified way. So the new version tests
only set equality.
This passes "make ptestlong".
And you're co-author.
--
Ticket URL: <http://trac.sagemath.org/ticket/17410#comment:5>
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.
