#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:
Keywords: | Work issues:
Authors: | Commit:
Report Upstream: N/A | 60018569126f690eda0b417f5fec1485904c59ed
Branch: | Stopgaps:
public/bliss |
Dependencies: |
#17552 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Hello,
> So what do you suggest that we do? Just avoid digraphs for now?
Let's wait for his answer. It would be a pity to miss digraphs just
because of that. He may know how to fix it.
> We can leave the code as is then!
Yepyep
> As far as I get the current state of affairs, we need to
>
> 1. Leave out the is_isomorphic thing
> 2. Find a workaround for the digraph thing.
>
> and then we are almost done?
Right !
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:60>
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.
