Hi David, On 2019-03-22, David Coudert <david.coud...@gmail.com> wrote: > Our interface to nauty geng is in Python, but the difficulty is not here. > > - It takes time to build graphs from graph6 strings, and also to build > Sandpiles (12 for each graph) > - The number of biconnected graphs with 12 nodes is huge: 153.620.333.545 > > See https://oeis.org/A002218 > > Some parallelism could certainly help here, but there will be no miracle.
If I understand correctly, this thread is about how to create an iterator for these graphs that does not try to generate all of them at once (and if I understand correctly, nauty/geng provides such iterator, it just isn't wrapped, but could easily be, since the output of geng, which is a stand-alone executable, can be read as a string [by a wrapper in Sage] and then translated into a graph). The miracle would be that in a doc test you could probably iterate over the first 10 graphs, demonstrating that you do not need to create the remaining 153,620,333,535. Best regards, Simon -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
