#17464: Computing the automorphism group of a graph with Bliss
-------------------------+-------------------------------------------------
Reporter: azi | Owner:
Type: | Status: needs_work
enhancement | Milestone: sage-6.5
Priority: major | Resolution:
Component: graph | Merged in:
theory | Reviewers: Nathann Cohen
Keywords: | Work issues:
Authors: | Commit:
Jernej Azarija | 9d708203dd3236f3c192faab6b573799fa5c1c32
Report Upstream: N/A | Stopgaps:
Branch: |
public/bliss |
Dependencies: |
#17552, #18145 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Good news:
{{{
sage: g1=PermutationGroup([[(2,3),(4,5)], [(2,4),(3,5)], [(1,2),(4,6)],
[(0,1),(4,5)]])
sage: g2=PermutationGroup([[(2,3),(4,5)], [(2,4),(3,5)],
[(1,2,3),(4,5,6)], [(1,6),(2,5,4,3)], [(0,1),(2,3)]])
sage: g1==g2
True
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:143>
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.
