#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 azi):
Replying to [comment:52 ncohen]:
> Hello again !
Hi there!
>
> I made a pass on this code, added some doc, fixed a few things and...
Well, now I only have a couple of questions about this branch:
>
> - What about implementing bliss' version of `is_isomorphic` later ? The
feature that we need right now is `automorphism_group` (I needed it
today, the difference is amazing!), so can't the rest be done later if we
need it ? By the way, I never had any slowness problem with
`is_isomorphic` (or `canonical_label`) that I can remember.
Hm.. I need these things, especially canonical_label. Do you have any
practical reasons to leave this out? I mean it doesn't look like it needs
that much effort at this point.
>
> - It seems that the `Bliss fatal error: Internal error - unknown
splitting heuristics` problem is not solved. I see it happen when I run
the tests in the graph/ folder.
Weird. Are you sure you're using the patched version of bliss?
>
> - I changed the code to list the vertices according to
`enumerate(G.vertices())` instead of `enumerate(G)`. We have this standard
in other places that when vertices are turned into integers, it is done
using the ordering of `G.vertices()`.
good, thanks!
>
> Tell me what you think ! I would be glad to have this into Sage soon
`;-)`
I just have another question! Is the new add_gen function faster than
before? Do you think it makes sense to try using the suggestion from here
? http://stackoverflow.com/questions/27657473/efficiently-converting-a
-bijection-to-cycle-notation
>
> Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:54>
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.
