#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 | f8dcb7e4ffca76715b478ada498be1714e0f38f1
Branch: | Stopgaps:
u/azi/bliss |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by azi):
Thanks for the input!!
Continuing our talk here I have a short question. The class definitions of
a Graph and Digraph in bliss both contain the same functions add_edge(int
i, int j) and change_color(int x, int c).
Now as far as I see *if* we patch bliss to make these two functions a
(virtual) part of the abstract graph class then we could do something like
{{{
AbstractGraph *g;
g = either Graph or Digraph
g.add_edge(i,j)
g.change_color(i,c)
g.find_automorphisms()
}}}
I think this would be the most efficient way to handle digraphs/graphs.
Do you think this will work out or do you see any other way to handle
these two types?
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:5>
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.
