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/71a58f36-34b2-4a0d-ae75-496df2f72ed4n%40googlegroups.com.
