#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 | Work issues:
Report Upstream: N/A | Commit:
Branch: | c39b6807ccd7662739eb02e9df5ced511c41ff39
u/charpent/unambiguously_doctest_longest_path__| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Hello,
Are you sure that it is unique ? Why the output can not be the same path
in the other direction
{{{
[(3, 4, None), (2, 0, None), (0, 3, None)]
}}}
You can at least test the length or the set of edges.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/17410#comment:3>
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.
