#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.12
Component: combinatorics | Resolution:
Keywords: binary trees, trees | Merged in:
Authors: darij | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------------+--------------------------
Comment (by chapoton):
I think one could separate two methods:
* one called `graph`, which gives the empty graph for BinaryTree() and
satisfy t.graph().num_verts() == len(list(t)) (the vertices have valency
at most 2)
* another one called `completed_graph`, which adds the leaves as new
vertices, and builds a tree where every vertex has valency either 2 or 0.
Then for BinaryTree(), one would have just one vertex.
To be done..
--
Ticket URL: <http://trac.sagemath.org/ticket/14564#comment:11>
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/groups/opt_out.
