#19586: Add is_cayley_graph
-------------------------------------+-------------------------------------
Reporter: jaanos | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.10
Component: graph theory | Resolution:
Keywords: Cayley graphs | Merged in:
groups | Reviewers:
Authors: Janoš Vidali | Work issues:
Report Upstream: N/A | Commit:
Branch: | 2e14f6959299bbcca913eef22822ae9c51b2fc84
u/jaanos/add_is_cayley_graph | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jaanos):
Hi!
> I am impressed with your code: not a single line seems out of place.
Could you add a comment around this call to 'edge_iterator', to say that
you mean to deal with all (out-)neighbors with multiplicity?
Thanks! Will do, just a bit later (currently I'm trying various solutions
for #19585).
> Could you also add a doctest (possibly in a 'TESTS:' section) for those
directed/multigraph cases?
Sure. By the way, do we have any easily-constructible multigraphs/graphs
with loops ready? Otherwise there'd be a few lines of code just to
construct the graph.
Also, `cayley_graph` on a group will not return multiedges or loops, even
when the generators contain repeated elements or the identity and `simple`
is set to `False`. So maybe this is something that should be changed.
Janoš
--
Ticket URL: <http://trac.sagemath.org/ticket/19586#comment:17>
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.
