#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,

 > 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.

 Well, there is no reason to leave `canonical_label` out, even though I
 don't get why the current canonical label function from Sage wouldn't do
 the job for you.

 It was more about the `is_isomorphic` function that is not fully
 implemented. I wouldn't mind having this patch in Sage quick, and report
 the implementation of that to another ticket.

 > Weird. Are you sure you're using the patched version of bliss?

 I just made a test:
 - Loaded the branch
 - Checked that the branch contained the patches/ directory
 - erased my local copy of the bliss.tar file
 - installed it again

 Same result when I run "sage -tp 4 -l generic_graph.py". Don't you get the
 same errors ?

 > 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

 Ahahah. Well, his algorithm is short, I like it `:-)`

 It's up to you. I do not think that it is the bottleneck of any
 computations, so to me 'the easiest to read is the best choice'

 Nathann

--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:55>
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.

Reply via email to