#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 ncohen):
Hellooooooooooo !!!
> so I suspect the authors (whom I'm adding to cc now) must have had
something in mind.
I do not use these classes, and I do not really understand what they had
in mind indeed. But what I believe is that changing the graph function to
return a graph one 1 vertex instead of 0 does not match what they had in
mind when they wrote it either, so I think that it makes more sense to
keep the graph as it was before, and fix the plot problem in a different
way.
Just my opinion, of course, and I really do not use those classes. So if
you think that it is better to change the output of this graph() function
I will let somebody who understands all this better than I do review that
patch !
Have fuuuuuuuuuuuuuuuuuuuuuunnn !
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14564#comment:8>
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.
