#14564: BinaryTree().graph() falsely claims that the graph has 0 vertices
-------------------------------------+--------------------------------------
Reporter: darij | Owner: tbd
Type: defect | Status: needs_review
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 ncohen):
Hellooooooooooooo !
You change the associated graph of an empty binary tree to a non-empty
graph, but what about these things ?
{{{
sage: t1 = BinaryTree()
sage: t1
.
sage: t1.graph().vertices()
[0]
sage: list(t1)
[]
sage: list(t1.paths())
[]
sage: t1.depth()
0
}}}
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14564#comment:4>
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.
