#17464: Computing the automorphism group of a graph
-------------------------+-------------------------------------------------
Reporter: azi | Owner:
Type: | Status: needs_work
enhancement | Milestone: sage-6.5
Priority: major | Resolution:
Component: graph | Merged in:
theory | Reviewers:
Keywords: | Work issues:
Authors: | Commit:
Report Upstream: N/A | cad441ec9fcfa114fc481411e949557845c45ab5
Branch: | Stopgaps:
public/bliss |
Dependencies: |
#17552 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
> I think it would be good to mention how the patch is created since there
may be different parameters to diff and also since we like to just copy
paste stuff and not think too much.
Well, open a ticket and add the explanation. Sage's doc is changed exactly
like the code is `:-P`
> Yes that's right. What made me choose the present version is the fact
that the second line is already a for loop over the vertices and from how
I understand g.vertices() that always involves a loop as well (at least to
get the labels of the graph, grrr)?
I do not think that the time difference is anything but negligible there.
Plus a "loop" does not cost anything by itself, it depends on what you
loop I expect. If the loop involves many calls to `.next()` or something
it may cost more than doing the same on a simple list, I don't know..
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:36>
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.
