#18239: Constructing Cayley graphs is slow
--------------------------------+------------------------
Reporter: azi | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.7
Component: group theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------+------------------------
Comment (by ncohen):
> As far as I've profiled it seems that most of the time is spent
multiplying PermutationGroup elements.
>
> Also I am not sure but perhaps GRAPE is perhaps implemented in C and is
already more efficient for this reason alone.
Well, being a C code may explain why it could be faster but now why it
would be SO much faster.
It turns out [1] that there are several implementations of this
`cayley_graph` function. There is one in `sage.categories.semigroups` and
another in `groups/group.pyx`. Do you know which one is run by your code ?
It would help if you could share this group A.
Nathann
[1] See? I don't scream anymore. Of course I want to punch a lot of
people, but I say "It turns out"
--
Ticket URL: <http://trac.sagemath.org/ticket/18239#comment:4>
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.
