#18498: Sierpinski graph
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton | Status: needs_review
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: |
-------------------------+-------------------------------------------------
Comment (by dcoudert):
What about putting this method in a new file dedicated to families of
directed graphs in directory `generators` (similar to file `families.py`
for undirected graphs), adding it an extra parameter
`directed=True/False`, and then calling it from both `graphs` and
`digraphs` with appropriate parameters?
Inside the method, it should be enough to have `G = DiGraph() if directed
else Graph()` and the rest will be the same.
I don't know if there is a trick to avoid the `directed` parameter. May be
there is. Nathann?
--
Ticket URL: <http://trac.sagemath.org/ticket/18498#comment:9>
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.
