is this "nauty26r7/geng" a program available?
Also, as Python is slow, any part of the nautygen can be written in other
language, such as C/C++?
Thanks,
Laura
On Wednesday, March 20, 2019 at 11:48:38 PM UTC-7, Jori Mäntysalo (TAU)
wrote:
>
> On Thu, 21 Mar 2019, Ai Bo wrote:
>
> > Is there a way to "random access"? For example, access the nth element
> > in the "generator", instead of one by one?
>
> Kind of. As a most time is propably spent by creating Python data
> structures for SageMath, you can use nautygen directly to generate huge
> number of graphs.
>
> As an example, it takes below 5 seconds to generate all biconnected graphs
> on 10 vertices, and I took third last one:
>
> $ nauty26r7/geng 10 -C | tail -3 | head -1
> >A /home/jm58660/lat-koe/nauty26r7/geng -Cd2D9 n=10 e=10-45
> >Z 9743542 graphs generated in 4.59 sec
> I]~~~~~~w
>
> and now
>
> sage: g = Graph('I]~~~~~~w', format='graph6')
> sage: g.is_biconnected()
> True
>
>
> --
> Jori Mäntysalo
>
> Tampereen yliopisto - Ihminen ratkaisee
--
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.
