#14564: BinaryTree().graph() falsely claims that the graph has 0 vertices
-------------------------------------+--------------------------------------
Reporter: darij | Owner: tbd
Type: defect | Status: needs_info
Priority: minor | Milestone: sage-5.10
Component: combinatorics | Resolution:
Keywords: binary tree, tree | Work issues:
Report Upstream: N/A | Reviewers:
Authors: darij | Merged in:
Dependencies: | Stopgaps:
-------------------------------------+--------------------------------------
Comment (by darij):
Hi Nathannnnnn! Thanks for looking in the file. ``list``,
``graph().vertices()`` and ``depth()`` seem to be correct (``list`` is not
supposed to be the list of all vertices, as far as I understand), or am I
missing something? I don't really like the ``paths()`` answer (isn't there
a 0-length path from the root to itself?), but that answer appears
precisely that way in the docstring:
{{{
sage: list(BinaryTree().paths())
[]
}}}
so I suspect the authors (whom I'm adding to cc now) must have had
something in mind.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14564#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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
