Thanks! I have opened https://trac.sagemath.org/ticket/33703 and CCed you
On Wednesday, April 13, 2022 at 11:27:46 AM UTC+5:30 jonatha...@googlemail.com wrote: > Sure. Since this is written in cython, using > https://cython.readthedocs.io/en/latest/src/userguide/parallelism.html > might be a good choice. > > This is also used in > `src/sage/geometry/polyhedron/combinatorial_polyhedron/face_iterator.pyx`. > Note the first two lines of the file. With those lines, you can just do > `from cython.parallel cimport ...` and use it. > If your computer has `OpenMP`, this should parallelize. > > But depends a bit on the details. You can just cc me (gh-kliem) on the > ticket and we can discuss the details from there. > > And make sure to mention the ticket number here, so anyone interested can > just take a look. > > adarsh.k...@gmail.com schrieb am Dienstag, 12. April 2022 um 15:55:16 > UTC+2: > >> I think I might get how to do it. Can I open a ticket for this? >> >> On Tuesday, April 12, 2022 at 12:11:05 PM UTC+5:30 Adarsh Kishore wrote: >> >>> Hi everyone, >>> >>> I was going through the file >>> `SAGE_ROOT/src/sage/graphs/spanning_tree.pyx` and I found this in the TODO >>> section >>> [image: Screenshot from 2022-04-12 12-06-18.png] >>> >>> I read up on Boruvka's algorithm for finding the minimum spanning tree >>> of a graph and have implemented a serialized version of it in Python. Can >>> someone link me to resources on how to parallelize this algorithm? >>> >> -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/1ff9a631-4fc8-481e-9e78-1a0d9652d902n%40googlegroups.com.
