Hi all,
I am hoping to generate a list of all graph isomorphism classes of a given
size. The current code that I have first generate all the graphs on 2n, and
then take all the isomorphism class representatives of size n. But the
first step of generating all graphs on 2n vertices can take a
On Mon, Jan 30, 2023 at 5:29 PM kcrisman wrote:
>
> Is there any notion that the default should be changed, or is that pretty
> unique to this example?
IMHO a small default is not expensive, as checking for smallish prime
factors should be quick.
But perhaps I'm missing something here.
Dima
>
Is there any notion that the default should be changed, or is that pretty
unique to this example?
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
I think everybody understands what's going on regarding ECM now,
thanks to Dima's quick answer.
Paul Zimmerman who wrote this code (and reads sage-support via a daily
digest), sent me this
note to pass on as well:
" Hi William,
please can you forward my answer below?
Thanks,
Paul
Disable Anaconda and read what "./configure" says at the end (these
messages are for you)
On Sunday, January 29, 2023 at 2:07:52 PM UTC-8 hyunjo...@gmail.com wrote:
> Hello,
>
> I've been trying to build Sage 9.8 from source for development; I had
> previously done so months ago, but I had not
