#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):
Hi Frederic,
thanks for the comments.
Having a keyword for {{{graph}}} seems more reasonable indeed, but there
is a problem with this. If I set the default option to ignore leaves, then
it changes the semantics of the method (currently it doesn't ignore
leaves). If I set the default option to use leaves, then it is the
opposite of the default option in {{{to_undirected_graph}}}. So I would be
either planting a backwards compatibility landmine or a false analogy
landmine. Which is better?
Best regards,\\
Darij
--
Ticket URL: <http://trac.sagemath.org/ticket/14564#comment:15>
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.
