#18498: Sierpinski graph
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton | Status: needs_info
Type: | Milestone: sage-6.8
enhancement | Resolution:
Priority: minor | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: graph | Commit:
Authors: | bac36fb6c3090be0fa33a5f7ef2f61b53ec93871
Frédéric Chapoton | Stopgaps:
Report Upstream: N/A |
Branch: |
u/chapoton/18498 |
Dependencies: |
-------------------------+-------------------------------------------------
Changes (by ncohen):
* status: needs_review => needs_info
Comment:
> I don't know if there is a trick to avoid the `directed` parameter. May
be there is. Nathann?
What you propose "can be done", it is not a big problem. And the only
'trick' I see to avoid the additional keyword and the private method would
be to 1) create the Graph 2) orient its edges. This way the digraph
constructor would merely call the graph constructor, and know what to do
because it knows what the vertex set is.
Of course, that only works if ths orientation can be easily deduced from
each edge.
For the moment, however, I am much more concerned that what is a
Sierpinski graph in Sage is what is called a Sierpinski graph in the
litterature.
Nathann
P.S.: I set this ticket to `needs_info`, as your code contains a
"REFERENCES: todo"
--
Ticket URL: <http://trac.sagemath.org/ticket/18498#comment:10>
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/d/optout.
