Thank you for your interest in this project. 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.
It is strongly suggested to start reading the developper guide of Sagemath, and the application guide https://wiki.sagemath.org/GSoC/Contributors To get the current state of implementation, you can look at the code of the graph module. You will find methods for the enumeration of simple paths, the k shortest simple paths, cycles, etc. 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 Monday, March 10, 2025 at 6:32:02 AM UTC+1 Adham Elsaady wrote: > Hello, > > My name is *Adham*, and I am from *Egypt*. I am excited to express my > interest in contributing to this project -*Paths and cycles enumeration > methods in graphs project*- and becoming an active member of the > community. > > As this will be my first contribution, I would greatly appreciate it if > you could suggest a beginner-friendly issue to help me get started. I am > eager to learn, collaborate, and make a meaningful contribution. > > Looking forward to your guidance. > > Best regards. > -- 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/fcbd2e41-858e-4d18-bc98-da34d7b2c06bn%40googlegroups.com.
