#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.13
Component: combinatorics | Resolution:
Keywords: binary trees, trees | Merged in:
Authors: darij | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------------+--------------------------
Comment (by darij):
I've been following what seems to be the more common notation in the
sourcecode, and understanding "node" to mean "interior node", i. e., "non-
leaf vertex". Should I change this or better document this?
Also, this is not really relevant to #14564, but since we're discussing in
this ticket already: The q-hook length formula in #14498 still uses a q
from the SymbolicRing. Should I change it to take any arbitrary input as
q, defaulting to a polynomial variable over ZZ?
--
Ticket URL: <http://trac.sagemath.org/ticket/14564#comment:19>
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.
