#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: Vincent Delecroix
Charpentier | Work issues:
Report Upstream: N/A | Commit:
Branch: | fcc15b40f515eef263f8afdc6c4d848fa28fead0
u/charpent/unambiguously_doctest_longest_path__| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by {'newvalue': u'Emmanuel Charpentier', 'oldvalue': u'Emmanuel
Charpentier, Vincent Delecroix'}):
* reviewer: => Vincent Delecroix
* author: Emmanuel Charpentier, Vincent Delecroix => Emmanuel Charpentier
Comment:
Hi Emmanuel,
I changed my status from author to reviewer. That's more reasonable.
why `bool(something)` instead of `something` like in
{{{
sage: p = G.longest_path()
sage: set(p.edges(labels=False)) == {(0,3), (2,0), (3,4)}
True
}}}
(and by the way, the option `labels=False` of the method `.edges` is
really cool)
Sorry for being so picky.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/17410#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.
