The page
https://doc.sagemath.org/html/en/developer/portability_testing.html#using-our-pre-built-docker-images-for-development-in-vs-code
has a link to a number of more container options
On Monday, June 19, 2023 at 3:29:35 PM UTC-7 Beth Claire wrote:
> I saw the cocalc docker, and yeah,
I saw the cocalc docker, and yeah, it's too big to run on my laptop.
On Monday, June 19, 2023 at 5:07:54 PM UTC-4 William Stein wrote:
> On Mon, Jun 19, 2023 at 1:19 PM William Stein wrote:
> >
> > On Mon, Jun 19, 2023 at 11:58 AM Beth Claire <318...@gmail.com> wrote:
> > >
> > > The docker
On Mon, Jun 19, 2023 at 1:19 PM William Stein wrote:
>
> On Mon, Jun 19, 2023 at 11:58 AM Beth Claire <318...@gmail.com> wrote:
> >
> > The docker image available here:
> > https://hub.docker.com/r/sagemath/sagemath
> > Has not been updated since Sagemath 9.7. Is that image supported by the
> >
On Mon, Jun 19, 2023 at 11:58 AM Beth Claire <318...@gmail.com> wrote:
>
> The docker image available here:
> https://hub.docker.com/r/sagemath/sagemath
> Has not been updated since Sagemath 9.7. Is that image supported by the sage
> team? Is there another image I should use?
I also build
The docker image available here:
https://hub.docker.com/r/sagemath/sagemath
Has not been updated since Sagemath 9.7. Is that image supported by the
sage team? Is there another image I should use?
Thanks,
Beth
--
You received this message because you are subscribed to the Google Groups
On Mon, 19 Jun 2023 at 14:27, Dima Pasechnik wrote:
> One can do something like this; start from your graph G, take
> D=G.planar_dual(), in D take a spanning tree, and starting from the
> root of the tree,
> and orientation chosen in the face corresponding to the root, proceed
> recursively to
One can do something like this; start from your graph G, take
D=G.planar_dual(), in D take a spanning tree, and starting from the
root of the tree,
and orientation chosen in the face corresponding to the root, proceed
recursively to induce orientations on the adjacent faces.
On Mon, Jun 19,
You need to provide your code. Of course it is relevant to know what is in
those few loops.
- Marc
On Monday, June 19, 2023 at 5:10:49 AM UTC-5 ayan.mah...@gmail.com wrote:
> Hello All,
> I have written a program. That takes as input an integer. Produces
> something. Not relevant. When the
oh, right, what I suggested isn't what you asked for, sorry.
On Mon, 19 Jun 2023, 13:56 John Cremona, wrote:
> Thanks Dima for the suggestion. I'm not sure that this does what I need:
> the associated directed graph has each edge directed, which is not what I
> was needing, and the faces of
Thanks Dima for the suggestion. I'm not sure that this does what I need:
the associated directed graph has each edge directed, which is not what I
was needing, and the faces of the directed graph look identical to those of
the original -- in particular, the edges of each face are tuples (x,y)
On Mon, Jun 19, 2023 at 11:18 AM John Cremona wrote:
>
> I have some quite small graphs which are polyhedral, each is the 1-skeleton
> of a (connected convex) polyhedron such as a cube, tetrahedron, etc,
> constructed from a list of edge pairs.
>
> I can get the faces of one of these, say G,
I have some quite small graphs which are polyhedral, each is the 1-skeleton
of a (connected convex) polyhedron such as a cube, tetrahedron, etc,
constructed from a list of edge pairs.
I can get the faces of one of these, say G, via G.faces(). This returns a
list of lists of vertices, each one
Hello All,
I have written a program. That takes as input an integer. Produces
something. Not relevant. When the input is 15, the program works fine with
memory usage 3.8% and steady.
When I increase the input to 25, memory usage increases. That is expected.
But what is unexpected is that the
13 matches
Mail list logo
