#17464: Computing the automorphism group of a graph
-------------------------+-------------------------------------------------
Reporter: azi | Owner:
Type: | Status: needs_info
enhancement | Milestone: sage-6.5
Priority: major | Resolution:
Component: graph | Merged in:
theory | Reviewers:
Keywords: | Work issues:
Authors: | Commit:
Report Upstream: N/A | 3f4553d1cb40c8d2dbfd55bdef4323877c0b4321
Branch: | Stopgaps:
u/azi/bliss |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by azi):
I'd be glad if someone could take a look at this branch. It is far from
being "production ready" and I mainly posting it here because
1. I want any comments and suggestions if its going in the right
direction(to avoid later rewrites :D)
2. I need someone to explain how to make a spkg so that I can properly
include bliss headers and be able to link against bliss.
3. Discuss what to do with the add_gen function that converts a
permutation to cycle notation. Do you agree that I leave it there and
avoid using Permutation.to_cycle()?
4. How to handle digraphs elegantly?
I wrote that above question for the general audience but honestly,..
Nathann what do you think??
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:2>
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.
