Thank you for your interest in this project and your first contributions to Sagemath.
Recall that the short description gives ideas for the project and you, the potential contributor, are expected to turn the ideas into a full proposal. For algorithms, you can read for instance recent papers on the k shortest simple paths like - https://dl.acm.org/doi/pdf/10.1145/3626567 and references there in - https://link.springer.com/article/10.1007/s12532-025-00276-0 Sincerely, David. On Saturday, March 22, 2025 at 10:20:24 PM UTC+1 Ziad Tarek wrote: > Hello everyone, > > I hope you are doing well. > > My name is Ziad, and I am interested in the *Paths and Cycles Enumeration > Methods in Graphs* project for *GSOC 2025*. > > I have successfully built Sage from the source code and have started > working on some issues (PR #39754 > <https://github.com/sagemath/sage/pull/39754>). While working on this, I > also discovered a bug and opened a corresponding issue (#39756 > <https://github.com/sagemath/sage/issues/39756>), and I am currently > working on a solution. > > I am actively familiarizing myself with the SageMath source code and hope > to contribute more. I find the project fascinating and would appreciate any > guidance you could provide to help me prepare better for GSOC. > > Thank you for your time! > -- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-gsoc+unsubscr...@googlegroups.com. To view this discussion visit https://groups.google.com/d/msgid/sage-gsoc/a9f46a4c-9076-4f38-9a6c-b000b66046c6n%40googlegroups.com.
