I've opened https://trac.sagemath.org/ticket/32424 for this issue with Sage
9.4.
On Wednesday, August 25, 2021 at 8:15:02 PM UTC-7 wst...@gmail.com wrote:
> Hi,
>
> I release cocalc-docker ([1], [2]) a few days ago with sage-9.4, and had
> people reporting back "illegal instruction" issues. S
Thanks, that does exactly what I needed! It is significantly faster and
uses significantly less memory.
--Beth
On Wednesday, August 25, 2021 at 6:33:36 AM UTC-5 Jean-Florent Raymond
wrote:
> Hello,
>
> The function shortest_simple_paths returns an iterator with paths sorted
> by increasing len
Hi,
I release cocalc-docker ([1], [2]) a few days ago with sage-9.4, and had
people reporting back "illegal instruction" issues. Sage is built there
with SAGE_FAT_BINARY="yes", using this script [3]. One person who reported
a problem had a "Dell PowerEdge R710." and I built on an intel Dell
> I believe that most of the traffic these days is on sage-support and
> sage-devel, rather than the more specialized groups. Feel free to post
> questions about Sage's algebra capabilities here.
There is some activity on sage-nt too, but sage-support and sage-devel
are much more consistently a
In the end I build 9.4 from source and that worked perfectly. And it turned
out that the Ubuntu 18.04 binaries of 9.2 also work on this particular
machine (though we went for 9.4 in the end). Thanks again for the help.
Op dinsdag 24 augustus 2021 om 18:03:01 UTC+2 schreef slelievre:
> 2021-08-2
Hello,
The function shortest_simple_paths returns an iterator with paths sorted
by increasing length. Therefore if you only want paths of minimum
length, you can iterate over the result of shortest_simple_paths and
stop as soon as you encounter a longer path. That way you do not iterate
over all t
