#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:58 ncohen]:
 > Yo !
 >
 > > Oh, yes I do get the errors as well. What do you suggest that we do at
 this point?
 >
 > Can you report this to the author again? The bug is not fixed, perhaps
 he will find the problem.
 Yes sure. I am in correspondence with him and I am waiting for his reply
 right now. So before I flood him with this new email I'd like to wait for
 his answer.

 In the meantime I'd like to push this thing further without having to wait
 for his fix/reply.

 One way we could try is to call Digraph::set_heuristic or something.
 Though I was not able to make it work in cython due to some enum typedefs
 issue.

 So what do you suggest that we do? Just avoid digraphs for now?
 >
 > > Unless you find his supercool I'd like to stay with what is already
 there since otherwise I have to understand how his code works. His
 solution is faster though.
 >
 > No problem, as you like. What he implemented is exactly the same
 algorithm, however. He just makes it shorter by using fancier pyhon. I
 think that in C his algorithm would be slower than yours, but not in
 Python `;-)`
 We can leave the code as is then!

 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?

 Best,

 Jernej

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