#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 | 6679f16ab3db644a285ed8706eafa587eafee4a3
Branch: | Stopgaps:
public/bliss |
Dependencies: |
#17552 |
-------------------------+-------------------------------------------------
Comment (by azi):
First of all happy new year and stuff!!!!
I've now pushed the latest branch for bliss but I am having a problem
since when I do sage -t generic_graph.py it keeps saying
{{{
def is_vertex_transitive(self, partition=None, verbosity=0,
^
IndentationError: unindent does not match any outer indentation level
}}}
and I and vim's :list are just blind... (dont' see it)
Do you happen to see where the indentation breaks and do you happen to
have any new comments about the current code? I think it should be pretty
near to what it should look like.
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:38>
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.
